Pagini recente » Cod sursa (job #2405017) | Cod sursa (job #2598000) | Cod sursa (job #2663081) | Cod sursa (job #3132739) | Cod sursa (job #2698773)
#include <fstream>
using namespace std;
ifstream fin("pascal.in");
ofstream fout("pascal.out");
const int kk=5000001;
int v[kk];
long long f[kk];
int main()
{
int n,r,d,c=0;
fin>>r>>d;
for(int i=1; i<=r; i++)
{
if(i%d==0)
v[i]=v[i/d]+1;
else
v[i]=0;
f[i]=f[i-1]+v[i];
}
for(int i=0; i<=(r-1)/2; i++)
{
if(f[r]>(f[r-i]+f[i]))
c+=2;
}
if(r%2==0)
c++;
fout<<c;
return 0;
}