Pagini recente » Cod sursa (job #685234) | Cod sursa (job #2206080) | Cod sursa (job #1074404) | Cod sursa (job #285497) | Cod sursa (job #1515584)
#include <cstdio>
#include <iostream>
#include <set>
#include <climits>
#include <map>
#include <algorithm>
#include <list>
#include <vector>
#include <utility>
using namespace std;
int main() {
freopen("sum.in", "r", stdin);
freopen("sum.out", "w", stdout);
ios::sync_with_stdio(false);
cin.tie(0);
int n, fi[100005];
for (int i = 1; i <= 100000; i++) {
fi[i] = i;
}
for (int i = 2; i <= 100000; i++) {
if (fi[i] == i) {
for (int j = i; j <= 100000; j += i) {
fi[j] /= i;
fi[j] *= i - 1;
}
}
}
cin >> n;
for (int tt = 1; tt <= n; tt++ ) {
long long x;
cin >> x;
cout << 2 * x * fi[x] << "\n";
}
return 0;
}