Pagini recente » Cod sursa (job #3248495) | Cod sursa (job #1370057) | Cod sursa (job #1906354) | Cod sursa (job #2584991) | Cod sursa (job #352006)
Cod sursa(job #352006)
#include<stdio.h>
long n;
long f(long k)
{
char v[1000000];
memset(v,1,1000000);
long i,j,ret=0;
int d=2;
j=2;
if(k==2)
return 1;
if(!(k%2))
while(j<k)
{
v[j]=0;
j*=d;
d++;
}
for(i=3;i<(k/2)+1;i+=2)
{
if(!(k%i))
{
d=2;
j=i;
while(j<k)
{
v[j]=0;
j*=d;
d++;
}
}
for(i=1;i<n;i++)
if(v[i])
ret++;
return ret;
}
int main()
{
long i;
long long fract;
freopen("fractii.in",'r',stdin)';
freopen("fractii.out",'w',stdout);
cin>>n;
for(i=1;i<n;++i)
fract+=f(i);
fract*=2;fract++;
cout<<fract;
return 0;
}