Pagini recente » Cod sursa (job #1136210) | Cod sursa (job #1047320) | ONIS 2014, Clasament | Cod sursa (job #3190842) | Cod sursa (job #2792951)
#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();
}
int phi[100001];
void solve() {
int i, j;
for (i = 2; i <= 100000; i++)
phi[i] = 1;
for (i = 2; i <= 100000; i++)
if (phi[i] == 1)
for (j = i; j <= 100000; j += i)
phi[j] *= (i - 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;
}