Pagini recente » Cod sursa (job #1030978) | Cod sursa (job #1706107) | Cod sursa (job #1905170) | Cod sursa (job #1400144) | Cod sursa (job #1051272)
#include <fstream>
using namespace std;
const int MAX_X = 100002;
int N;
int phi[MAX_X];
int main() {
ifstream f("sum.in");
ofstream g("sum.out");
for(int i = 2; i < MAX_X; ++i)
phi[i] = i - 1;
for(int i = 2; i < MAX_X; ++i)
for(int j = 2 * i; j < MAX_X; j += i)
phi[j] -= phi[i] ;
f >> N;
for(int i = 1, x; i <= N; ++i) {
f >> x;
g << (long long) 2 * phi[x] * x << "\n";
}
f.close();
g.close();
return 0;
}