Pagini recente » Cod sursa (job #3170947) | Cod sursa (job #1777092) | Cod sursa (job #1719248) | Cod sursa (job #2439461) | Cod sursa (job #2792950)
#include <fstream>
#include <vector>
#include <bitset>
using namespace std;
int n;
int a[100001];
void read() {
int i;
ifstream f("sum.in");
f >> n;
for (i = 1; i <= n; i++)
f >> a[i];
f.close();
}
bitset<100001> e;
int phi[100001];
void solve() {
int i, j;
for (i = 2; i <= 100000; i++)
phi[i] = 1;
for (i = 2; i <= 100000; i++)
if (!e[i]) {
phi[i] = i - 1;
for (j = 2 * i; j <= 100000; j += i) {
phi[j] *= phi[i];
e[j] = 1;
}
}
}
void output() {
int i;
ofstream g("sum.out");
for (i = 1; i <= n; i++)
g << 2LL * phi[a[i]] * a[i] << '\n';
g.close();
}
int main() {
read();
solve();
output();
return 0;
}