Cod sursa(job #1071692)
| Utilizator | Data | 3 ianuarie 2014 13:28:53 | |
|---|---|---|---|
| Problema | Sum | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.58 kb |
#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) ;
printf("%lld\n",(long long)V[X]*2*X) ;
}
return 0 ;
}
