Pagini recente » Cod sursa (job #438861) | Cod sursa (job #1144394) | Cod sursa (job #2120397) | Cod sursa (job #1491817) | Cod sursa (job #2114067)
#include <bits/stdc++.h>
using namespace std;
ifstream fi("fractii.in");
ofstream fo("fractii.out");
using i64 = long long;
const int N = 1e6 + 5;
i64 phi[N];
int main(void) {
int n;
i64 ans;
fi >> 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] = phi[j] * (i - 1) / i;
ans = 0;
for (int i = 1; i <= n; ++i)
ans+= phi[i];
fo << 2 * ans - 1 << endl;
return 0;
}