Cod sursa(job #3372885)
| Utilizator | Data | 5 noiembrie 2026 12:25:03 | |
|---|---|---|---|
| Problema | Pascal | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.48 kb |
#include <cstdio>
long long factorial(int n) {
long long p = 1;
for (int i=0;i<n;i++) {
p*=i;
}
return p;
}
int main() {
freopen("pascal.in", "r", stdin);
freopen("pascal.out", "w", stdout);
int n, m;
scanf("%d %d", &n, &m);
int count = 0;
long long k = factorial(n);
for (int i=1;i<n;i++) {
long long e = k/(factorial(n-i)*factorial(i));
if (e % m == 0) {
count++;
}
}
printf("%d", count);
}