Pagini recente » Cod sursa (job #161863) | Cod sursa (job #467054) | Cod sursa (job #1886415) | Cod sursa (job #358643) | Cod sursa (job #2683060)
#include <fstream>
#include <iostream>
using namespace std;
const int VMAX = 1000010;
int n;
long long int sol;
int euler[VMAX];
ifstream fin("fractii.in");
ofstream fout("fractii.out");
int main() {
fin >> n;
for (int i = 2; i <= n; i++)
euler[i] = i - 1;
for (int i = 2; i <= n; i++) {
sol += euler[i];
for (int j = 2 * i; j <= n; j += i)
euler[j] -= euler[i];
}
fout << 2 * sol + 1 << '\n';
return 0;
}