Cod sursa(job #2211551)
Utilizator | Data | 10 iunie 2018 21:22:10 | |
---|---|---|---|
Problema | Fractii | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.46 kb |
#include <fstream>
using namespace std;
ifstream cin("fractii.in");
ofstream cout("fractii.out");
int ind[1000009];
int main()
{
int n, ans(0);
cin >> n;
for (int i = 1; i <= n; ++i) {
ind[i] = i - 1;
}
for (int i = 1; i <= n; ++i) {
ans += ind[i];
for (int j = 2 * i; j <= n; j += i) {
ind[j] -= ind[i];
}
}/// i/j si j/i + 1/1
cout << ans * 2 + 1;
return 0;
}