Pagini recente » Cod sursa (job #2355193) | Cod sursa (job #1682307) | Cod sursa (job #821673) | Cod sursa (job #2985420) | Cod sursa (job #3252749)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("fractii.in");
ofstream fout("fractii.out");
#define int long long
const int NMAX = 1e6 + 5;
int phi[NMAX];
void build_phi()
{
for(int i = 1; i < NMAX; i++)
phi[i] = i;
for(int i = 2; i < NMAX; i++)
{
if(phi[i] == i)
{
phi[i]--;
for(int k = 2 * i; k < NMAX; k += i)
phi[k] = phi[k] / i * (i - 1);
}
}
}
int32_t main()
{
build_phi();
int n;
fin >> n;
int ans = 0;
for(int i = 1; i <= n; i++)
ans += 2 * phi[i];
fout << ans - 1 << "\n";
fin.close();
fout.close();
return 0;
}