Pagini recente » preoji2011 | Cod sursa (job #844975) | Cod sursa (job #1236224) | Cod sursa (job #767089) | Cod sursa (job #1123312)
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
ifstream fin("pascal.in");
ofstream fout("pascal.out");
int n;
int D;
fin>>n;
fin>>D;
if(D<2 || D>6)
{
fout<<0;
return 0;
}
int i,j,mat[5000][5000];
mat[3][1]=1;
mat[3][2]=2;
mat[3][3]=1;
for(i=4;i<=n+1;i++)
{
mat[i][1]=1;
for(j=2;j<i;j++)
{
mat[i][j]=mat[i-1][j-1]+mat[i-1][j];
}
mat[i][i]=1;
}
int nr=0;
for(int i=1; i<=n+1; i++)
{
if(mat[n+1][i]%D==0)
nr++;
}
fout<<nr;
//system("pause");
return 0;
}