Cod sursa(job #2231140)
Utilizator | Data | 13 august 2018 09:34:49 | |
---|---|---|---|
Problema | Sum | Scor | 95 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.48 kb |
#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;
}