Pagini recente » Cod sursa (job #1598958) | Cod sursa (job #1725148) | Cod sursa (job #2920669) | Cod sursa (job #219059) | Cod sursa (job #2231140)
#include <fstream>
using namespace std;
const int NMAX = 100000;
ifstream f("sum.in");
ofstream g("sum.out");
int Euler[NMAX + 1];
int main()
{
int N, X;
//
for(int i = 1; i <= NMAX; i++)
Euler[i] = i - 1;
for(int i = 2; i <= NMAX; i++)
for(int j = i + i; j <= NMAX; j += i)
Euler[j] -= Euler[i];
//
f >> N;
while(N--)
{
f >> X;
g << 2LL * X * Euler[X] << '\n';
}
return 0;
}