Pagini recente » Cod sursa (job #2622175) | Cod sursa (job #2319002) | Cod sursa (job #2949179) | Cod sursa (job #1521935) | Cod sursa (job #1319817)
#include <stdio.h>
#define MAXN 5000000
int f[MAXN+1], k[MAXN+1];
int main(){
int n, i, d, j, ans;
FILE *fin, *fout;
fin=fopen("pascal.in", "r");
fout=fopen("pascal.out", "w");
fscanf(fin, "%d%d", &n, &d);
for(i=d; i<=n; i*=d){
for(j=i; j<=n; j+=i){
f[j]++;
}
}
k[0]=0;
for(i=1; i<=n; i++){
k[i]=k[i-1]+f[i];
}
ans=0;
for(i=1; i<n; i++){
ans+=(k[n]-k[i]-k[n-i]>0);
}
fprintf(fout, "%d\n", ans);
fclose(fin);
fclose(fout);
return 0;
}