Pagini recente » Cod sursa (job #2532051) | Monitorul de evaluare | Cod sursa (job #2754262) | Cod sursa (job #1100759) | Cod sursa (job #1071690)
#include <cstdio>
using namespace std ;
const int MAXN = 100001 ;
int N , V[MAXN], X;
int main()
{
freopen("sum.in", "r", stdin);
freopen("sum.out", "w", stdout);
scanf("%d", &N) ;
for(int i = 2 ; i < MAXN; ++ i)
V[i] = i ;
for(int i = 2 ; i < MAXN; ++ i)
if(V[i] == i)
for(int j = i ; j < MAXN; j = j + i)
V[j] = V[j] / i * (i - 1) ;
for(int i = 1 ; i <= N ; ++ i)
{
scanf("%d", &X) ;
long long sol ;
sol = V[X] * 2 * X ;
printf("%lld\n",(long long)V[X]*2*X) ;
}
return 0 ;
}