Pagini recente » Borderou de evaluare (job #461569) | Cod sursa (job #250984) | Cod sursa (job #238534) | Cod sursa (job #954159) | Cod sursa (job #1205202)
#include <cstdio>
using namespace std;
const int N = 1e5 + 5;
long long phi[N], t, n;
int main() {
FILE *fin = fopen("sum.in", "r");
FILE *fout = fopen("sum.out", "w");
for (int i = 1; i < N; ++i)
phi[i] = i - 1;
for (int i = 2; i < N / 2; ++i)
if (phi[i] == i - 1)
for (int j = i * 2; j < N; j += i)
phi[j] -= phi[j] / i;
fscanf (fin, "%lld", &t);
while (t--) {
fscanf (fin, "%lld", &n);
fprintf (fout, "%lld\n", 2LL * n * phi[n]);
}
}