Pagini recente » Cod sursa (job #1694649) | Cod sursa (job #2190060) | Cod sursa (job #635701) | Cod sursa (job #2060942) | Cod sursa (job #2276465)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("fractii.in");
ofstream g("fractii.out");
long long nr;
int n;
int phi[1000001];
int main()
{
int i,j;
f>>n;
nr=1;
for (i=1;i<=n;i++)
{
phi[i]=i;
}
for(i=2;i<=n;i++)
{
if(phi[i]==i)
{
for(j=i;j<=n;j=j+i)
{
phi[j]=phi[j]/i;
phi[j]=phi[j]*(i-1);
}
}
}
for(i=2;i<=n;i++)
for(i=2;i<=n;i++)
{
nr=nr+2*phi[i];
}
g<<nr;
return 0;
}