Pagini recente » Cod sursa (job #1342121) | Cod sursa (job #2219051) | Cod sursa (job #49606) | Cod sursa (job #2646135) | Cod sursa (job #2537116)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("sum.in");
ofstream g("sum.out");
const int NMAX = 100000;
int euler[NMAX + 5];
void Euler(int n)
{
for (int i = 2; i <= n; i++)
euler[i] = i - 1;
for (int i = 2; i <= n; i++)
{
for (int j = 2 * i; j <= n; j += i)
euler[j] -= euler[i];
}
}
int main()
{
Euler(NMAX);
int n;
f >> n;
while(n--)
{
int x;
f >> x;
g << 1LL * euler[x] * 2 * x << '\n';
}
return 0;
}