Pagini recente » Cod sursa (job #2344756) | Cod sursa (job #1267704) | Cod sursa (job #777690) | Cod sursa (job #2754221) | Cod sursa (job #2232473)
#include <cstdio>
using namespace std;
const int NMAX = 100000;
int eul[NMAX+1];
void euler() {
for(int i = 1; i <= n; i++) eul[i] = i;
for(int i = 2; i <= n; i++)
if (eul[i] == i)
for(int j = i; j <= n; j += i)
eul[j] /= i, eul[j] *= (i-1);
}
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;
}