Pagini recente » Cod sursa (job #1510032) | Cod sursa (job #1355560) | Cod sursa (job #1743749) | Cod sursa (job #1561492) | Cod sursa (job #2673731)
#include <bits/stdc++.h>
using namespace std;
long long euler(int n)
{
long long p,a,copie,i;
p=n;
copie=n;
if(n%2==0)
{
p=p/2;
while(n%2==0) n=n/2;
}
for(i=3; i*i<=n; i+=2)
{
if(n%i==0)
{
p=p/i;
p*=(i-1);
while(n%i==0) n=n/i;
}
}
if(n>1)
{
p=p/n;
p*=(n-1);
}
return p;
}
int main()
{
freopen("fractii.in","r",stdin);
freopen("fractii.out","w",stdout);
int i,n;
long long sum=0;
scanf("%d",&n);
for(i=2; i<=n; i++)
{
sum+=euler(i);
}
sum=sum*2;
sum++;
printf("%d",sum);
return 0;
}