Pagini recente » Borderou de evaluare (job #2443106) | Diferente pentru happy-coding-2005-2/solutii intre reviziile 8 si 7 | Borderou de evaluare (job #1820031) | Borderou de evaluare (job #158849) | Cod sursa (job #223532)
Cod sursa(job #223532)
#include<stdio.h>
int main()
{
int e[1000001], i, j, n;
freopen("fractii.in","r",stdin);
freopen("fractii.out", "w", stdout);
scanf("%d", &n);
for(i=2;i<=n;i++)
e[i]=i;
for(i=2;i<=n;i++)
if(e[i]==i)
for(j=i;j<=n;j+=i)
e[j]=e[j]/i*(i-1);
long long s=0;
for(i=2;i<=n;i++)
s=s+e[i];
printf("%lld", 1+2*s);
return 0;
}