Pagini recente » Cod sursa (job #2581327) | Cod sursa (job #423229) | Cod sursa (job #3264326) | Cod sursa (job #1180154) | Cod sursa (job #220356)
Cod sursa(job #220356)
#include<fstream.h>
#include<iostream.h>
int n,w,i,f[1000],x;
long long s, phi;
int main()
{
ifstream in("fractii.in");
ofstream out("fractii.out");
in>>x;
for(n=2;n<=x;n++)
{
w=n;
phi=n;
for(i=2;i*i<=n;++i)
{
if(w%i==0)
{
phi=((long long) phi * (i - 1)) / i;
while(w%i==0) w=w/i;
}
}
if(w!=1) {
phi = ((long long) phi * (w - 1)) / w;
}
s=s+(2*phi);
}
out<<s+1<<endl;
return 0;
}