Pagini recente » Cod sursa (job #2617384) | Cod sursa (job #349260) | Cod sursa (job #2687658) | Cod sursa (job #2883111) | Cod sursa (job #1205196)
#include <fstream>
using namespace std;
ifstream fin ("sum.in");
ofstream fout ("sum.out");
const int N = 1e5 + 5;
long long phi[N], t, n;
int main() {
for (int i = 2; i < N; ++i)
phi[i] = i;
for (int i = 2; i * i < N; ++i)
if (phi[i] == i)
for (int j = i; j < N; j += i)
phi[j] -= phi[j] / i;
fin >> t;
while (t--) {
fin >> n;
fout << 2LL * n * phi[n] << "\n";
}
}