Pagini recente » Cod sursa (job #1077507) | Cod sursa (job #559683) | Cod sursa (job #3196242) | Cod sursa (job #1766105) | Cod sursa (job #2416186)
#include <fstream>
#include <iostream>
using namespace std;
int n, fractii = 1, v[1000001];
int main() {
ifstream f("fractii.in");
ofstream g("fractii.out");
f >> n;
v[0] = 1;
v[1] = 1;
for(int i = 1; i <= 1000000; i++)
v[i] = i-1;
for(int i = 2; i <= 1000000; i++)
for(int j = 2*i; j <= n; j+= i)
v[j] -= v[i];
for(int i = 2; i <= n; i++)
fractii += 2 * v[i];
g << fractii;
f.close();
g.close();
return 0;
}