Pagini recente » Cod sursa (job #1877927) | Cod sursa (job #578385) | Cod sursa (job #3326639) | Cod sursa (job #2348798) | Cod sursa (job #3322629)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("sum.in");
ofstream g("sum.out");
const int NMAX = 100000;
int Phi[NMAX + 1];
void Euler(int 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;
}
int main()
{
int n, x;
Euler(NMAX);
f >> n;
while(n--)
{
f >> x;
g << 2LL * Phi[x] * x << '\n';
}
f.close();
g.close();
return 0;
}