Pagini recente » Cod sursa (job #1942764) | Cod sursa (job #3134776) | Cod sursa (job #1502564) | Cod sursa (job #530869) | Cod sursa (job #2178001)
#include <iostream>
#include <fstream>
#define dMAX 100005
using namespace std;
int n, phi[dMAX + 5], temp;
unsigned long long int S;
ifstream fin("sum.in");
ofstream fout("sum.out");
void GeneratePhi() {
int i, j;
for (i = 1; i <= dMAX; i++) phi[i] = i;
for (i = 2; i <= dMAX; i++) {
if (phi[i] == i) {
for (j = i; j <= dMAX; j += i) {
phi[j] = phi[j] * (i - 1)/i;
}
}
}
for (i = 2; i <= n; i++) {
phi[i] *= 2;
}
}
int main()
{
int i, j;
fin >> n;
GeneratePhi();
while (n--) {
fin >> temp;
fout << 1LL * 2 * temp * phi[temp] << '\n';
}
return 0;
}