Pagini recente » Cod sursa (job #1870733) | Cod sursa (job #1977073) | Cod sursa (job #2332399) | Cod sursa (job #2028479) | Cod sursa (job #228880)
Cod sursa(job #228880)
#include<stdio.h>
const int N=1000000;
int e[N];
void euler()
{
for(int j=1;j<N;++j)
e[j]=j;
for(int i=2;i<N;++i)
if(e[i]==i)
for(int j=i;j<N;j+=i)
e[j]=e[j]/i*(i-1);
}
int main()
{
freopen("fractii.in","r",stdin);
freopen("fractii.out","w",stdout);
int n;
scanf("%d",&n);
euler();
long long s=0;
for(int i=2;i<=n;++i)
s+=(long long)e[i];
printf("%lld\n",1+2*s);
fclose(stdin);
fclose(stdout);
return 0;
}