Pagini recente » Cod sursa (job #1291055) | Cod sursa (job #1751270) | Cod sursa (job #436226) | Istoria paginii runda/lmk_1 | Cod sursa (job #1202750)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f ("fractii.in");
ofstream g ("fractii.out");
const int NMAX = 1000000;
int n, i, j;
long long sol;
int v[NMAX];
void rezolva () {
for (i = 2; i <= n; ++i) {
v[i] += i - 1;
for (j = i + i; j <= n; j += i) v[j] -= v[i];
sol += v[i];
}
sol = sol * 2 + 1;
g << sol << '\n';
}
int main () {
f >> n;
rezolva ();
return 0;
}