Pagini recente » Cod sursa (job #33639) | Cod sursa (job #298630) | Cod sursa (job #1133570) | Cod sursa (job #2184255) | Cod sursa (job #1393634)
#include<cstdio>
#include<algorithm>
#include<cstring>
#define Nmax 5000005
using namespace std;
int n,i,j,d,f[Nmax][3];
int sol,x,y,z;
int main()
{
freopen("pascal.in","r",stdin);
freopen("pascal.out","w",stdout);
scanf("%d %d",&n,&d);
for (i=1;i<=n;i++)
{
f[i][0]=f[i/2][0]+i/2;
f[i][1]=f[i/3][1]+i/3;
f[i][2]=f[i/5][2]+i/5;
}
for (i=0;i<=n;i++)
{
x=f[n][0]-f[i][0]-f[n-i][0];
y=f[n][1]-f[i][1]-f[n-i][1];
z=f[n][2]-f[i][2]-f[n-i][2];
if (d==2)
if (x>0) sol++;
if (d==3)
if (y>0) sol++;
if (d==5)
if (z>0) sol++;
if (d==4)
if (x>1) sol++;
if (d==6)
if (x>0 && y>0 ) sol++;
}
printf("%d",sol);
return 0;
}