Cod sursa(job #561585)
Utilizator | Data | 20 martie 2011 20:25:34 | |
---|---|---|---|
Problema | Sum | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.43 kb |
#include<stdio.h>
#define Nmax 100009
int x, i, j, n, a[Nmax];
long long q;
int main()
{
freopen ("sum.in","r",stdin);
freopen ("sum.out","w",stdout);
scanf("%d",&n);
for (i = 2; i < Nmax; i++)
a[i] = i;
for (i = 2; i < Nmax; i++)
if (a[i] == i)
for (j = i; j < Nmax; j += i)
a[j] = a[j] / i*(i-1);
for (i = 1; i <= n; i++)
{
scanf("%d",&x);
q=(long long) 2 * x * a[x];
printf("%lld\n",q);
}
return 0;
}