Cod sursa(job #1526105)
| Utilizator | Data | 15 noiembrie 2015 22:42:48 | |
|---|---|---|---|
| Problema | Fractii | Scor | 30 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.46 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
ifstream f("fractii.in");
ofstream g("fractii.out");
long nr, a[100001], n, i, j;
f >> n;
nr = 0;
for (i = 1; i <= n; i++)
a[i] = i - 1;
for (i = 2; i <= n; i++) {
for (j = 2 * i; j <= n; j += i)
a[j] -= a[i];
nr += a[i];
}
g << 2 * nr + 1 << endl;
f.close ();
g.close ();
return 0;
}
