Pagini recente » Cod sursa (job #1968438) | Cod sursa (job #2576959) | Cod sursa (job #738201) | Cod sursa (job #90152) | Cod sursa (job #3124597)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin ("pascal.in");
ofstream fout ("pascal.out");
const int Nmax=5000000;
int r, d;
long long f[Nmax+1];
int main()
{
fin>>r>>d;
f[0]=f[1]=0;
for (int i=2; i<=r; i++){
int aux=i;
while (aux%d==0){
aux/=d;
f[i]++;
}
f[i]+=f[i-1];
}
int cnt;
for (int i=0; i<=r; i++){
if (f[r]-f[i]-f[r-i]>0)
cnt++;
}
fout<<cnt;
return 0;
}