Cod sursa(job #2793634)
Utilizator | Data | 3 noiembrie 2021 20:29:41 | |
---|---|---|---|
Problema | Fractii | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.34 kb |
#include<iostream>
using namespace std;
int main()
{
int n, j;
long long s = 0;
int v[1000001];
cin >> n;
int i;
for (i = 1; i <= n; ++i)
v[i] = i;
for (i = 1; i <= n; ++i)
for (j = i * 2; j <= n; j = j + i)
v[j] = v[j] - v[i];
for (i = 1; i <= n; ++i)
s += 2 * v[i];
cout << s;
return 0;
}