Pagini recente » Cod sursa (job #734067) | Cod sursa (job #791041) | Cod sursa (job #1393340) | Cod sursa (job #2985439) | Cod sursa (job #39029)
Cod sursa(job #39029)
#include<stdio.h>
#include<string.h>
int n,i,j,k;
long long nr;
char prim[10001];
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,sizeof(prim));
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;}