Pagini recente » Cod sursa (job #2498649) | Cod sursa (job #407032) | Cod sursa (job #2190303) | Cod sursa (job #1342081) | Cod sursa (job #1703211)
#include <iostream>
#include <cstdio>
using namespace std;
const int maxn = 100005;
int v[100005];
int main()
{
freopen("sum.in", "r", stdin);
freopen("sum.out", "w", stdout);
int n;
scanf("%d", &n);
for(int i = 1;i < 100005; i++)
v[i] = i - 1;
for(int i = 2; i < 100005; i++)
for(int j = 2; 1LL * i * j < 100005; j++)
v[i * j] = v[i * j] - v[i];
for(int i = 1; i <= n; i++)
{
int x;
scanf("%d", &x);
printf("%lld\n", 2LL * x * v[x]);
}
return 0;
}