Pagini recente » Cod sursa (job #3161481) | Borderou de evaluare (job #2012405) | Borderou de evaluare (job #710080) | Cod sursa (job #952226) | Cod sursa (job #1148961)
#include <fstream>
#include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <iomanip>
#include <string>
#include <cmath>
using namespace std;
int main()
{
ifstream cin("sum.in");
ofstream cout("sum.out");
const int Xmax = int(1e5) + 5;
vector<int> ans(Xmax,-1);
for (int i = 1; i < Xmax; i++) {
ans[i] = i - 1;
}
for (int i = 2; i < Xmax; i++) {
for (int j = i + i; j < Xmax; j += i) {
ans[j] -= ans[i];
}
}
int testCount;
cin >> testCount;
while (testCount--) {
int x;
cin >> x;
cout << 2LL * ans[x] * x << "\n";
}
return 0;
}