Pagini recente » Cod sursa (job #130497) | Cod sursa (job #3145323) | Cod sursa (job #2133421) | Cod sursa (job #1862862) | Cod sursa (job #1070435)
#include <iostream>
#include<fstream>
using namespace std;
int main()
{
int phi[1000007], da[1000007],i,j,k,n;
long long sum;
ifstream f("fractii.in");
ofstream g("fractii.out");
f>>n;
for(i=2;i<=n;i++)
{phi[i]=i;
da[i]=0;
}
for(i=2;i<=n;i++)
{
if (da[i]==0)
{
for(j=1;j<=n/i;j++)
{
da[j*i]=1;
phi[j*i]=(phi[j*i]/i)*(i-1);
}
}
}
sum=0;
for(i=2;i<=n;i++) sum+=(long long) phi[i];
g<<2*sum+1;
return 0;
}