Cod sursa(job #223719)
| Utilizator | Data | 29 noiembrie 2008 09:56:52 | |
|---|---|---|---|
| Problema | Sum | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.52 kb |
#include <stdio.h>
#define max 100005
int e[max];
void euler()
{
int j,i;
for (i=2; i<max; i++)
e[i]=i;
for (i=2; i<max; i++)
if (e[i]==i)
for (j=i; j<max; j+=i)
e[j]=e[j]/i*(i-1);
}
int main()
{
freopen("sum.in","r",stdin);
freopen("sum.out","w",stdout);
int x,y,rez,n,i;
long long fin;
scanf("%d",&n);
euler();
for (i=1; i<=n; i++)
{
fin=0;
scanf("%d",&x);
fin=2*(long long)e[x]*x;
printf("%lld\n",fin);
}
return 0;
}