Pagini recente » Cod sursa (job #2829541) | Cod sursa (job #1957767) | Cod sursa (job #275117) | Cod sursa (job #512431) | Cod sursa (job #2765360)
#include <iostream>
#include <bitset>
#include <cstdio>
using namespace std;
int const N = 5e6 + 3;
int v [N] , r , d , ans , v2 [N];
char log [N] , log3 [N];
void getLog (int x){
for(int i = 2 ; i <= r ; ++ i)
if (i % x == 0)
log [i] = 1 + log [i / x] , v [i] = v [i - 1] + log [i];
else
v [i] = v [i - 1];
return;
}
int main()
{
freopen ("pascal.in" , "r" , stdin);
freopen ("pascal.out" , "w" , stdout);
scanf ("%d%d" , &r , &d);
if (d == 2 || d == 3 || d == 5){
getLog (d);
for(int i = 1 ; i <= r ; ++ i)
if (v [r] > v [r - i] + v [i])
++ ans;
printf ("%d" , ans);
return 0;
}
if (d == 4){
getLog (2);
for(int i = 1 ; i <= r ; ++ i)
if (v [r] > v [r - i] + v [i] + 1)
++ ans;
printf ("%d" , ans);
return 0;
}
d/=0;
for(int i = 2 ; i <= r ; ++ i){
v [i] = v [i - 1];
if (i % 2 == 0)
log [i] = 1 + log [i >> 1] , v [i] += log [i];
if (i % 3 == 0)
log3 [i] = 1 + log3 [i / 3] , v [i] += log3 [i];
}
for(int i = 0 ; i <= r ; ++ i)
if ((v [r] > v [r - i] + v [i]) && (v2 [r] > v2 [r - i] + v2 [i]))
++ ans;
printf ("%d" , ans);
return 0;
}