Pagini recente » Cod sursa (job #956977) | Cod sursa (job #2102817) | Cod sursa (job #1669141) | Cod sursa (job #3148346) | Cod sursa (job #2712033)
#include <bits/stdc++.h>
#define int long long
using namespace std;
ifstream fin("sum.in");
ofstream fout("sum.out");
const int DIM = 1e5;
int sieve[DIM + 1];
void Euler() {
for(int i = 1; i <= DIM; ++i)
sieve[i] = i;
for(int i = 2; i <= DIM; ++i)
if(sieve[i] == i)
for(int j = 1; j * i <= DIM; ++j)
sieve[j * i]= sieve[j * i] / i * (i - 1);
}
void test_case() {
int N;
fin >> N;
fout << (sieve[N] * (N << 1)) << '\n';
}
int32_t main() {
int T;
fin >> T;
Euler();
for(int tc = 0; tc < T; ++tc)
test_case();
}