Pagini recente » Cod sursa (job #2272388) | Cod sursa (job #1802361) | Cod sursa (job #2166577) | Cod sursa (job #1414163) | Cod sursa (job #783761)
Cod sursa(job #783761)
#include<stdio.h>
using namespace std;
int phi(int n){
int result=1;
if(!(n%2)){
n/=2;
while(!(n%2)){
n/=2;
result*=2;
}
}
for(int k=3;k*k<=n;k+=2){
if(!(n%k)){
n/=k;
result*=k-1;
while(!(n%k)){
n/=k;
result*=k;
}
}
}
if(n>1)
result*=n-1;
return result;
}
int main()
{
freopen("fractii.in","r",stdin);
freopen("fractii.out","w",stdout);
long int n,i,z=1;
scanf("%lu",&n);
for(i=2;i<=n;i++)
z=z+phi(i)*2;
printf("%u",z);
return 0;
}