Cod sursa(job #954589)
Utilizator | Data | 29 mai 2013 16:20:07 | |
---|---|---|---|
Problema | Lowest Common Ancestor | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include<cstdio>
int n,x,y,k,i,j,v[1000007];
void re()
{
for(j=1;j<=y/2;j++)
for(i=j;i<=y;i=i+j)v[i]++;
for(j=y/2+1;j<=y;j++)v[j]++;
}
void ver()
{
for(i=x;i<=y;i++)if(i%v[i]==0)k++;
printf("%d",k);
}
int main()
{
freopen("magicnum.in","r",stdin);
freopen("magicnum.out","w",stdout);
scanf("%d %d",&x,&y);
re();
ver();
return 0;
}