Pagini recente » Cod sursa (job #114086) | Cod sursa (job #1652358) | Cod sursa (job #118653) | Cod sursa (job #3158552) | Cod sursa (job #1607103)
#include <iostream>
#include <fstream>
using namespace std;
int factorial(int n)
{ if(n<=1)
return 1;
return n*factorial(n-1);
}
int element(int i,int R)
{ int n_fact=0,k_fact=0,nk_fact=0;
n_fact=factorial(R);
k_fact=factorial(i);
nk_fact=factorial(R-i);
return n_fact/k_fact*nk_fact;
}
int main()
{ ifstream fin("pascal.in");
ofstream fout("pascal.out");
int R,D,cont=0;
fin>>R>>D;
for(int i=0;i<=R;i++)
if(element(i,R)%D==0)
cont++;
fout<<cont-1;
fin.close();
fout.close();
return 0;
}