Cod sursa(job #2400411)
| Utilizator | Data | 8 aprilie 2019 18:33:13 | |
|---|---|---|---|
| Problema | Fractii | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.48 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("fractii.in");
ofstream g("fractii.out");
int main()
{
int n = 0, V[1000000];
f >> n;
for (int i = 1; i <= n; i++) {
V[i] = i;
}
for (int i = 2; i <= n ; i++) {
V[i]--;
for (int j = 2 * i; j <= n; j += i) {
V[j] -= V[i];
}
}
int contor = 0;
for (int i = 1; i <= n; i++) {
contor += V[i] * 2 - 1;
}
g << contor;
return 0;
}
