Pagini recente » Cod sursa (job #1220918) | Cod sursa (job #1910057) | Cod sursa (job #803819) | Cod sursa (job #3328420) | Cod sursa (job #3343454)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("fractii.in");
ofstream fout("fractii.out");
const int DIM = 1e6 + 5;
int n;
long long ans;
int phi[DIM];
void Compute(int n);
int main()
{
fin >> n;
Compute(n);
for (int i = 2; i <= n; ++i)
ans += phi[i];
fout << (1LL * ans * 2 + 1);
return 0;
}
void Compute(int n)
{
for (int i = 2; i <= n; ++i)
phi[i] = i - 1;
phi[1] = 1;
for (int i = 2; i <= n; ++i)
for (int j = 2 * i; j <= n; j += i)
phi[j]--;
}