Cod sursa(job #2664735)
| Utilizator | Data | 29 octombrie 2020 11:12:54 | |
|---|---|---|---|
| Problema | Fractii | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.55 kb |
#include <fstream>
using namespace std;
int E[1000005];
int main()
{
ifstream cin("fractii.in");
ofstream cout("fractii.out");
long long int n, cnt = 0;
cin >> n;
for(int i =1 ; i <= n ; i ++)
E[i] = i;
for(int i = 2; i <= n ; i ++)
if(E[i] == i)
{
E[i] --;
for(int j =2 ; j * i <= n ; j ++)
E[j * i]= E[j * i] / i * (i - 1);
}
for(int i = 1; i <= n; i ++)
{
cnt += 2 * E[i];
}
cout << cnt - 1;
return 0;
}
