Pagini recente » Cod sursa (job #2160075) | Cod sursa (job #230001) | Cod sursa (job #2141707) | Cod sursa (job #2333582) | Cod sursa (job #2244716)
#include <fstream>
using namespace std;
ifstream in("sum.in");
ofstream out("sum.out");
const int N_MAX = 100000;
int totient[N_MAX + 1];
void compute_totient2(int N) {
for(int i = 1; i <= N; i++)
totient[i] = i;
for(int i = 2; i <= N; i += 2)
totient[i] >>= 1;
for(int i = 3; i <= N; i += 2)
if(totient[i] == i)
for(int j = i; j <= N; j += i)
totient[j] -= totient[j] / i;
}
int main() {
compute_totient2(N_MAX);
int N, X;
in >> N;
while(N--) {
in >> X;
out << 2LL * totient[X] * X << '\n';
}
return 0;
}