Pagini recente » Cod sursa (job #2373210) | Cod sursa (job #3271413) | Cod sursa (job #735507) | Cod sursa (job #2274486) | Cod sursa (job #2627227)
#include <iostream>
#include <fstream>
using namespace std;
const int VMAX = 1000010;
ifstream fin("fractii.in");
ofstream fout("fractii.out");
int n;
long long int sol;
int euler[VMAX];
int main()
{
fin >> n;
for(int i =1 ; i <= n ; i ++)
euler[i] = i;
for(int i = 2; i <= n ; i ++)
if(euler[i] == i)
{
euler[i] --;
for(int j =2 ; j * i <= n; j ++)
euler[j * i]= euler[j * i] / i * (i - 1);
}
for(int i = 2; i <= n ; i ++)
sol+=euler[i];
fout<<sol*2 + 1;
fin.close();
fout.close();
return 0;
}