Pagini recente » Cod sursa (job #1572694) | Cod sursa (job #2245466) | Cod sursa (job #25719) | Cod sursa (job #933252) | Cod sursa (job #2047138)
#include <fstream>
using namespace std;
ifstream fin("Fractii.in");
ofstream fout("Fractii.out");
const int N=1000001;
int v[N];
void Euler()
{
for(int i=1;i<=N;i++)v[i]=i;
for(int i=2;i<=N;i++)
{
if(v[i]==i)for(int j=i;j<=N;j+=i)v[j]/=i,v[j]*=(i-1);
}
}
int main()
{
Euler();
long long S=0;
int n;
fin>>n;
for(int i=2;i<=n;i++)S+=v[i];
fout<<S*2+1;
return 0;
}