Pagini recente » Cod sursa (job #3235426) | Cod sursa (job #2508658) | Cod sursa (job #2090539) | Cod sursa (job #2346915) | Cod sursa (job #980673)
Cod sursa(job #980673)
#include <iostream>
#include <fstream>
using namespace std;
#define MAXN 100010
int PHI[MAXN];
void preproc()
{
PHI[1] = 1;
for(int i = 2; i <= MAXN; i++)
{
PHI[i] = i - 1;
}
for(int i = 2; i < MAXN; i++)
{
for(int j = 2 * i; j < MAXN; j += i)
{
PHI[j] -= PHI[i];
}
}
}
int main()
{
ifstream in("sum.in");
ofstream out("sum.out");
int n,x;
preproc();
in>>n;
while(n--)
{
in>>x;
out << 1LL * PHI[x] * x * 2 << "\n";
}
return 0;
}