Cod sursa(job #58292)
Utilizator | Data | 4 mai 2007 23:32:51 | |
---|---|---|---|
Problema | Pascal | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.33 kb |
#include<stdio.h>
long a[309][300];
int main()
{long n,i,j,d,sol=0;
FILE*f=fopen("pascal.in","r");
FILE*g=fopen("pascal.out","w");
fscanf(f,"%ld %ld",&n,&d);
a[0][0]=1;
for(i=1;i<=n+1;i++)
for(j=1;j<=i;j++)
a[i][j]=a[i-1][j-1]+a[i-1][j];
for(i=1;i<=n+1;i++) if (a[n+1][i]%d==0) sol++;
fprintf(g,"%ld",sol);
return 0;}