Pagini recente » Cod sursa (job #511911) | Cod sursa (job #3187394)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("pascal.in");
ofstream fout("pascal.out");
int factorial(int n){
int i,p=1;
for(i=1;i<=n;i++)
p*=i;
return p;
}
int combinari(int n,int k){
return factorial(n)/factorial(k)*factorial(n-k);
}
int main()
{
int a[1001][1001],R,D,i,j,c=0;
fin >> R >> D;
for(i=0;i<=R+1;i++){
a[i][1] = 1;
a[i][i] = 1;
}
for(i=1;i<=R+1;i++){
for(j=1;j<i;j++){
a[i][j] = combinari(i,j);
}
}
for(i=1;i<=R;i++)
if(a[R+1][i]%D==0)
c++;
fout << c;
return 0;
}