Pagini recente » Cod sursa (job #259678) | Cod sursa (job #50240) | Cod sursa (job #892991) | Borderou de evaluare (job #804927) | Cod sursa (job #58295)
Cod sursa(job #58295)
#include<stdio.h>
long *a=new long[5000000];
int main()
{long n,i,j,d,sol=0,p,x,y;
FILE*f=fopen("pascal.in","r");
FILE*g=fopen("pascal.out","w");
fscanf(f,"%ld %ld",&n,&d);
p=2; a[1]=1; a[2]=1;
for(i=1;i<=n+1;i++)
{
p++; a[p]=1; x=1;
for(i=2;i<p;i++)
{
y=a[i];
a[i]=x+y;
x=y;
}
}
// a[i][j]=a[i-1][j-1]+a[i-1][j];
for(i=1;i<=n+1;i++) if (a[i]%d==0) sol++;
fprintf(g,"%ld",sol);
return 0;}