Cod sursa(job #2722887)
| Utilizator | Data | 13 martie 2021 12:53:36 | |
|---|---|---|---|
| Problema | Fractii | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.52 kb |
#include <fstream>
using namespace std;
const int NMAX = 1000000;
int v[1 + NMAX];
int main()
{
ifstream in("fractii.in");
ofstream out("fractii.out");
int n;
in >> n;
for (int i = 2; i <= n; i++)
{
v[i] = i - 1;
}
long long sol = 0;
for (int i = 2; i <= n; i++)
{
sol += v[i];
for (int j = 2 * i; j <= n; j += i)
{
v[j] -= v[i];
}
}
out << 2 * sol + 1 << '\n';
return 0;
}
