Cod sursa(job #2592496)
Utilizator | Data | 1 aprilie 2020 19:06:24 | |
---|---|---|---|
Problema | Sum | Scor | 90 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.5 kb |
#include <iostream>
#include <fstream>
#define nmax 100005
using namespace std;
ifstream fin("sum.in");
ofstream fout("sum.out");
long long phi[nmax];
void Euler() {
long long i,j;
for(i=1;i<nmax;i++)
phi[i]=i;
for(i=1;i<nmax;i++)
for(j = 2*i;j <= nmax;j+=i)
phi[j] -= phi[i];
}
int main() {
long long n, x;
long long t, i;
Euler();
fin >> n;
for (i = 1; i <= n;i++) {
fin >> x;
t = 2*x * phi[x];
fout << t << "\n";
}
return 0;
}