Cod sursa(job #2723333)
| Utilizator | Data | 13 martie 2021 21:56:15 | |
|---|---|---|---|
| Problema | Fractii | Scor | 30 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.5 kb |
#include <fstream>
#include <iostream>
#define nmax 1000001
using namespace std;
ifstream f("fractii.in");
ofstream g("fractii.out");
int v[nmax];
int main()
{
int n;
int s = 0;
f >> n;
v[1] = 1;
for (int i = 2; i <= n; i++)
{
v[i] = i - 1;
}
for (int i = 2; i <= n; i++)
{
s += v[i];
for (int j = 2 * i; j <= n; j += i)
{
v[j] -= v[i];
}
}
g << 2 * s + 1;
return 0;
}
