Cod sursa(job #2428074)
Utilizator | Andrei qfl1ck32 | Data | 3 iunie 2019 18:41:57 |
---|---|---|---|
Problema | Pascal | Scor | 20 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.6 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("pascal.in");
ofstream fout("pascal.out");
int factorial(int n)
{
if (n == 0 || n == 1)
return 1;
int x = 1, i;
for (i = 2; i <= n; i++)
x *= i;
return x;
}
int main()
{
int i, nrdiv = 0, R, D, ifac;
fin>>R>>D;
ifac = factorial(R);
for (i = 0; i <= R; i++)
if (factorial(R-i) * factorial(i) != 0)
if (ifac/((factorial(R-i)*factorial(i))) % D == 0)
nrdiv++;
fout<<nrdiv;
fin.close();
fout.close();
return 0;
}