Pagini recente » Cod sursa (job #767607) | Cod sursa (job #1789157) | Cod sursa (job #473812) | Cod sursa (job #2240382) | Cod sursa (job #2231149)
#include <cstdio>
using namespace std;
const int NMAX = 100000;
int eul[NMAX+1];
void euler() {
for(int i = 1; i <= NMAX; i++)
eul[i] = i-1;
for(int i = 2; i <= NMAX; i++)
if(eul[i] == i-1)
for(int j = i+i; j <= NMAX; j += i)
eul[j] -= eul[i];
}
int main()
{
freopen("sum.in", "r", stdin);
freopen("sum.out", "w", stdout);
euler();
int n;
scanf("%i", &n);
while(n--) {
int x;
scanf("%i", &x);
printf("%lld\n", 2LL * x * eul[x]);
}
return 0;
}