Cod sursa(job #2115317)
| Utilizator | Data | 26 ianuarie 2018 17:11:52 | |
|---|---|---|---|
| Problema | Pascal | Scor | 40 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.49 kb |
#include <bits/stdc++.h>
#define INF 2140000000
#define MOD 1000000007
#define MaxN 5000005
using namespace std;
FILE*IN=fopen("pascal.in","r"),*OUT=fopen("pascal.out","w");
int R,D,Ans=0,d[MaxN];
int main()
{
fscanf(IN,"%d%d",&R,&D);
for(int i=D;i<=R;i*=D)
for(int j=i;j<=R;j+=i)
d[j]++;
for(int i=1;i<=R;i++)
d[i]+=d[i-1];
for(int i=0;i<=R;i++)
Ans+=(d[R]-d[i]-d[R-i]>0);
fprintf(OUT,"%d",Ans);
return 0;
}
