Pagini recente » Cod sursa (job #1807168) | Cod sursa (job #1937437) | Cod sursa (job #32854) | Cod sursa (job #3283306) | Cod sursa (job #1815706)
#include <fstream>
using namespace std;
ifstream fi("sum.in");
ofstream fo("sum.out");
const int maxn = 100000;
long long int phi[maxn + 1];
int N;
void indicator()
{
for (int i = 1;i <= maxn;i++)
phi[i] = i;
for (int i = 2;i <= maxn;i++)
if (phi[i] == i)
{
for (int j = i;j <= maxn;j += i)
phi[j] /= i, phi[j] *= (i - 1);
}
return;
}
int main()
{
fi >> N;
indicator();
for (int i = 1;i <= N;i++)
{
int nr;
fi >> nr;
fo << 2 * nr*phi[nr] << '\n';
}
return 0;
}