Pagini recente » Cod sursa (job #2817785) | Cod sursa (job #2335193) | Cod sursa (job #2498253) | Cod sursa (job #2486901) | Cod sursa (job #952861)
Cod sursa(job #952861)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in ("pascal.in");
ofstream out("pascal.out");
int const N=5000005;
int r,d,rez,c[2][N];
int main()
{
in>>r>>d;
c[1][0]=c[0][0]=1;
for(int n=0;n<=r;n++)
for(int k=0;k<min(n+1,r/2);k++)
c[(n+1)%2][k+1]=c[n%2][k]+c[n%2][k+1];
int m=r%2; int sum=0;
for(int j=0;j<=r/2;j++)
if(c[m][j]%d==0) sum+=2;
if((r%2==0)&&(c[m][r/2]%d==0)) sum--;
out<<sum<<"\n";
return 0;
/* if(c[m][j]%d==0)
rez++;
if(r%2==1)
out<<rez<<"\n";
return 0;*/
}