Cod sursa(job #2511210)
| Utilizator | Data | 18 decembrie 2019 15:17:10 | |
|---|---|---|---|
| Problema | Fractii | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.42 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("fractii.in");
ofstream g("fractii.out");
long long n, i, j, a, k, nmax, s, phi[1000002], vizitat[1000002];
int main()
{
f >> n;
for(i = 1; i <= n; i++)
phi[i] = i - 1;
for(i = 2; i <= n; i++)
for(j = 2 * i; j <= n; j += i)
phi[j] -= phi[i];
for(i = 1; i <= n; i++)
s += phi[i];
g << (s * 2 + 1);
return 0;
}
