Pagini recente » Cod sursa (job #3165703) | Cod sursa (job #2374710) | Cod sursa (job #21304) | Cod sursa (job #3214473) | Cod sursa (job #1205194)
#include <fstream>
#include <cstdio>
using namespace std;
ofstream fout ("sum.out");
const int N = 1e5 + 5;
long long phi[N], t, n;
int main() {
freopen ("sum.in", "r", stdin);
for (int i = 2; i < N; ++i)
phi[i] = i;
for (int i = 2; i < N / 2; ++i)
if (phi[i] == i)
for (int j = i; j < N; j += i)
phi[j] -= phi[j] / i;
scanf ("%d", &t);
while (t--) {
scanf ("%d", &n);
fout << 2LL * n * phi[n] << "\n";
}
}