Cod sursa(job #2341145)
| Utilizator | Data | 11 februarie 2019 16:56:25 | |
|---|---|---|---|
| Problema | Pascal | Scor | 20 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.49 kb |
# include <iostream>
# include <fstream>
# include <algorithm>
# include <cmath>
using namespace std;
ifstream fi ("pascal.in");
ofstream fo ("pascal.out");
int n, d, s, fact[1001];
int main ()
{
fi >> n >> d;
fact[0] = 1;
for ( int i = 1; i <= n + 1; ++i)
{
fact[i] = fact[i-1] * i;
}
for ( int i = 0; i <= n; ++i)
{
if ((fact[n] / (fact[n - i] * fact[i])) % d == 0)
++s;
}
fo << s;
return 0;
}
