Pagini recente » Cod sursa (job #2250486) | Cod sursa (job #2713051) | Cod sursa (job #2369582) | Cod sursa (job #188615) | Cod sursa (job #39034)
Cod sursa(job #39034)
#include<stdio.h>
#include<string.h>
int n,i,j,k;
long long nr;
char prim[1000001];
int main()
{freopen("fractii.in","r",stdin);
freopen("fractii.out","w",stdout);
scanf("%d",&n);
nr=1;
for(i=2;i<=n;i++)
{memset(prim,1,i+1);
nr=nr+2;
for(j=2;j<i;j++)
{if(prim[j]&&i%j==0)
for(k=j;k<i;k=k+j)
prim[k]=0;
nr=nr+2*prim[j];}}
printf("%lld",nr);
fclose(stdout);
return 0;}