Pagini recente » Cod sursa (job #2309422) | Cod sursa (job #1205160) | Cod sursa (job #3188070) | Cod sursa (job #505121) | Cod sursa (job #2603038)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("fractii.in");
ofstream g("fractii.out");
int n;
bool val[1000001];
int phi[1000001];
long long calcphi(int n)
{
int i,j,nr;
for(i=1;i<=n;i++)phi[i]=i;
phi[1]=1;
long long s=0;
for(i=2;i<=n;i++)
{
if(phi[i]==i)
for(j=i;j<=n;j+=i)phi[j]-=phi[j]/i;
s+=phi[i];
}
s=s*2+1;
return s;
}
int main()
{
f>>n;
g<<calcphi(n);
return 0;
}