Cod sursa(job #3240659)
| Utilizator | Data | 19 august 2024 12:14:18 | |
|---|---|---|---|
| Problema | Fractii | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.46 kb |
#include <fstream>
using namespace std;
ifstream cin("fractii.in");
ofstream cout("fractii.out");
int n, phi[1000001];
long long ans;
int main()
{
cin >> n;
for(int i=1; i<=n; i++)
phi[i] = i;
for(int i=2; i<=n; i++)
if(phi[i] == i)
for (int j = i; j <= n; j += i)
phi[j] = phi[j] / i * (i - 1);
for(int i=1; i<=n; i++)
ans += phi[i] * 2;
cout << ans - 1;
return 0;
}
