Pagini recente » Cod sursa (job #57417) | Cod sursa (job #1148095) | Cod sursa (job #831139) | Cod sursa (job #2679513) | Cod sursa (job #2640867)
#include <cstdio>
using namespace std;
const int NMAX = 5000000;
int s[NMAX + 5] , p[NMAX + 5];
int main()
{
freopen("pascal.in" , "r" , stdin);
freopen("pascal.out" , "w" , stdout);
int n , d , i , x , j , nr;
scanf("%d%d", &n , &d);
x = d;
i = 1;
while(x <= n)
{
j = 1;
while(x * j <= n)
{
if(j % d != 0)
p[x * j] = i;
j ++;
}
i ++;
x = x * d;
}
for(i = 1 ; i <= n ; i ++)
p[i] = p[i] + p[i - 1];
nr = 0;
for(i = 1 ; i <= n ; i ++)
if(p[n] - p[i] - p[n - i] > 0)
nr ++;
printf("%d\n" , nr);
return 0;
}