Pagini recente » Cod sursa (job #269223) | Cod sursa (job #1637221) | Cod sursa (job #1517426) | Cod sursa (job #1672245) | Cod sursa (job #1297292)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f ("sum.in");
ofstream g ("sum.out");
const int NMAX = 100000 + 1;
int n;
int phi[NMAX];
inline void initializeaza() {
for (int i = 1; i < NMAX; i++) phi[i] = i - 1;
for (int i = 2; i < NMAX; i++)
for (int j = 2 * i; j < NMAX; j += i)
phi[j] -= phi[i];
}
inline void rezolva() {
int x;
f >> n;
while (n--) {
f >> x;
g << 1LL * x * phi[x] * 2 << '\n';
}
}
int main() {
initializeaza();
rezolva();
return 0;
}