Pagini recente » Cod sursa (job #1534551) | Cod sursa (job #2280248) | Cod sursa (job #2281649) | Cod sursa (job #2221650) | Cod sursa (job #2592489)
#include <iostream>
#include <fstream>
#define nmax 100005
using namespace std;
ifstream fin("sum.in");
ofstream fout("sum.out");
long long phi[nmax];
void Euler() {
long long i,j;
for(i=1;i<nmax;i++)
phi[i]=i;
for(i=1;i<nmax;i++) {
for(j = 2*i;j <= nmax;j+=i) {
phi[j] -= phi[i];
}
}
}
int main() {
long long i, j, n, x;
long long t;
Euler();
fin >> n;
for (i = 1; i <= n;i++) {
fin >> x;
t = (long long)x * phi[x] *2;
fout << t << "\n";
}
return 0;
}