Pagini recente » Cod sursa (job #2560235) | Cod sursa (job #1024701) | Cod sursa (job #1227415) | Cod sursa (job #1916083) | Cod sursa (job #1929961)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin ("pascal.in");
ofstream fout( "pascal.out");
int i,j,D,k=0,Nr;
long int R;
long int factorial(int n){
int P=1;
if(n==0){
return 1;
}
for(int o=1;o<=n;o++){
P=P*o;
}
return P;
}
int main()
{
fin>>R>>D;
fin.close();
for(i=R;i<=R;i++){
for(j=0;j<i+1;j++){
Nr=factorial(i)/(factorial(i-j)*factorial(j));
if(Nr%D==0){
k++;
}
}
fout<<k;
fout.close();
}
return 0;
}