Pagini recente » Cod sursa (job #911851) | Cod sursa (job #2152319) | Cod sursa (job #1845057) | Cod sursa (job #118494) | Cod sursa (job #2149577)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("fractii.in");
ofstream fout("fractii.out");
const int NMAX = 1000000 + 5;
long long int n, sum;
long long int phi[NMAX];
int main()
{
fin >> n;
for (int i = 1; i <= n; ++i)
phi[i] = i;
for (int i = 2; i <= n; ++i)
if (phi[i] == i)
for (int j = i; j <= n; j += i)
{
phi[j] /= i;
phi[j] *= (i - 1);
}
for (int i = 2; i <= n; ++i)
sum += phi[i];
fout << 2 * sum + 1;
return 0;
}