Cod sursa(job #2082083)
Utilizator | Vlad - Gabriel Iftimescu ezioconnor | Data | 5 decembrie 2017 18:16:49 |
---|---|---|---|
Problema | Sum | Scor | 95 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.51 kb |
#include <iostream>
#include <fstream>
#include <cmath>
using namespace std;
ifstream in("sum.in");
ofstream out("sum.out");
int phi[100001];
int main()
{
int n, x, i, j, k = 2;
in >> n;
for (i = 1; i <= 100000; ++i)
phi[i] = i - 1;
for (i = 2; i <= 100000; ++i)
{
for(j = 2 * i; j <= 100000; j += i)
phi[j] -= phi[i];
}
for (i = 1; i <= n; ++i)
{
in >> x;
out << 1LL * 2 * phi[x] * x << '\n';
}
return 0;
}