Pagini recente » Cod sursa (job #1979957) | Cod sursa (job #1666544) | Istoria paginii info-oltenia-2018/echipe/9-10 | Cod sursa (job #2681885) | Cod sursa (job #3222364)
#include <bits/stdc++.h>
#define QED fin.close(); fout.close(); return 0;
using namespace std;
const int VMAX = 1000006;
ifstream fin("sum.in");
ofstream fout("sum.out");
#define cin fin
#define cout fout
int v[VMAX + 1];
void ciur(int n)
{
for(int i = 2; i <= n; i ++)
v[i] = i;
for(int i = 2; i <= n; i++)
if(v[i] == i)
for(int j = 1; i * j <= n; j++)
v[i * j] -= v[i * j] / i;
}
int main()
{
ciur(VMAX);
long long s=0;
int n,x;
cin >> n;
for(int i=1; i<=n; i++)
{
cin>>x;
cout<<2LL*v[x]*x<<'\n';
}
QED
}