Pagini recente » Cod sursa (job #2105999) | Cod sursa (job #2338048) | Cod sursa (job #2390077) | Cod sursa (job #730248) | Cod sursa (job #2194586)
//#include <iostream>
#include <fstream>
using namespace std;
const int MAX = 1e6+1;
ifstream cin("fractii.in");
ofstream cout("fractii.out");
int n,v[MAX];
void euler()
{
int i;
for(i=1;i<=n;i++)
v[i]=i;
for(i=2;i<=n;i++)
if(v[i]==i)
for(int j=i;j<=n;j+=i)
v[j]=v[j]/i*(i-1);
}
int main()
{
cin>>n;
euler();
long long a=-1;
for(int i=1;i<=n;i++)
a=a+2*v[i];
cout<<a;
return 0;
}