Pagini recente » Cod sursa (job #282768) | Cod sursa (job #141598) | Cod sursa (job #2294643) | Cod sursa (job #292786) | Cod sursa (job #1098093)
#include <iostream>
#include <fstream>
using namespace std;
long long cnt,a[5000003],b[50000003],k,r,d;
int main()
{
ifstream f("pascal.in");
ofstream g("pascal.out");
f>>r>>d;
b[1]=1;
k=2;
while(k!=r+2)
{
for(int i=1;i<=k;i++)
a[i]=b[i-1]+b[i];
for(int i=1;i<=k;i++)
b[i]=a[i];
k++;
}
for(int i=1; i<=(r+1)/2; i++)
if(b[i]%d==0)cnt+=2;
if(r%2==0&&b[(r+1)/2+1]%d==0)cnt++;
g<<cnt;
return 0;
}