Pagini recente » Cod sursa (job #1201314) | Cod sursa (job #422832) | Cod sursa (job #886720) | Cod sursa (job #276890) | Cod sursa (job #757239)
Cod sursa(job #757239)
#include <fstream>
using namespace std;
int X, N;
int phi[100002];
int main()
{
ifstream fin("sum.in");
ofstream fout("sum.out");
for (int i = 1; i <= 100000; ++i)
phi[i] = i;
for (int i = 2; i <= 100000; ++i)
if (phi[i] == i)
for (int j = i; j <= 100000; j += i)
phi[j] -= phi[j] / i;
fin >> N;
while (N--)
{
fin >> X;
fout << 2LL * X * phi[X] << '\n';
}
fin.close();
fout.close();
}