Cod sursa(job #2298991)
| Utilizator | Data | 8 decembrie 2018 18:34:11 | |
|---|---|---|---|
| Problema | Fractii | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.52 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("fractii.in");
ofstream fout("fractii.out");
int euler[1000001];
int main()
{
int n;
fin >> n;
for (int i = 2; i <= n; ++i)
{
euler[i] = i - 1;
}
for (int i = 2; i <= n; ++i)
for (int j = 2 * i; j <= n; j += i)
euler[j] -= euler[i];
long long s = 0;
for (int i = 2; i <= n; ++i)
{
s += euler[i];
}
fout << s * 2 + 1;
return 0;
}
