Cod sursa(job #2091385)
| Utilizator | Data | 19 decembrie 2017 17:38:55 | |
|---|---|---|---|
| Problema | Pascal | Scor | 40 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.62 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream in("pascal.in");
ofstream out("pascal.out");
const int RMAX = 5e6;
int n, d, ans;
int fact[RMAX + 2];
int main()
{
in >> n >> d;
for(int div = d; div <= n; div *= d)
for(int i = div; i <= n; i += div)
fact[i]++;
for(int i = 1; i <= n; i++)
fact[i] += fact[i -1];
int numarator, numitor;
for(int i = 1; i <= n; i++)
{
numarator = fact[n];
numitor = fact[n - i] + fact[i];
if(numarator - numitor > 0)
ans++;
}
out << ans << '\n';
return 0;
}
