Pagini recente » Atasamentele paginii Heavy Path Decomposition | Cod sursa (job #2313950) | Cod sursa (job #2300078) | Cod sursa (job #2313990) | Cod sursa (job #2254814)
#include <iostream>
#include <fstream>
using namespace std;
const int nmax=1000001;
int phi[nmax];
ifstream fin("fractii.in");
ofstream fout("fractii.out");
int main()
{
long long N,nr=0,j;
fin>>N;
for(int i=2;i<=N;i++)
phi[i]=i-1;
for(int i=2;i<=N;i++)
{
nr=nr+phi[i];
for( j=2*i;j<=N;j=j+i)
phi[j]=phi[j]-phi[i];
}
fout<<nr*2+1<<"\n";
return 0;
}