Cod sursa(job #2377382)
| Utilizator | Data | 10 martie 2019 09:01:17 | |
|---|---|---|---|
| Problema | Fractii | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.5 kb |
#include <iostream>
#define dim 1000001
#include <fstream>
using namespace std;
ifstream f("fractii.in");
ofstream of("fractii.out");
int phi[dim];
int main()
{
long long int n, i, j, cnt = 0;
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 = 2; i <= n; i++)
cnt += phi[i];
cnt = cnt * 2 + 1 ;
of << cnt;
return 0;
}
