Pagini recente » Cod sursa (job #1866709) | Cod sursa (job #535487) | Cod sursa (job #829267) | Cod sursa (job #717900) | Cod sursa (job #1368453)
#include <stdio.h>
int r,d;
int cate[5000001],cate2[5000001],cate3[5000001];
int minim(int a,int b)
{
if(a>b) return b;
return a;
}
int main()
{
freopen ("pascal.in","r",stdin);
freopen ("pascal.out","w",stdout);
scanf("%d%d",&r,&d);
if(d==6)
{
for(int i=3;i<=5000000;i*=3)
{
for(int j=1;j<=5000000/i;j++) cate3[i*j]++;
}
for(int i=2;i<=5000000;i*=2)
{
for(int j=1;j<=5000000/i;j++) cate2[i*j]++;
}
for(int i=6;i<=5000000;i*=6)
{
for(int j=1;j<=5000000/i;j++) cate[i*j]++;
cate2[i]--;
cate3[i]--;
}
for(int i=2;i<=5000000;i++)
{
cate2[i]+=cate2[i-1];
cate[i]+=cate[i-1];
cate3[i]+=cate3[i-1];
}
int counter=0;
//printf("%d %d %d\n",cate2[r],cate3[r],cate[r]);
for(int j=1;j<=r;j++)
{
// printf("%d %d %d\n",cate2[r-j]+cate2[j],cate3[r-j]+cate3[j],cate[r-j]+cate[j]);
if((cate[r]-cate[r-j]-cate[j])+minim(cate3[r]-cate3[r-j]-cate3[j],cate2[r]-cate2[r-j]-cate2[j])>0) counter++;
}
printf("%d\n",counter);
}
}