Cod sursa(job #240838)
| Utilizator | Data | 8 ianuarie 2009 20:04:38 | |
|---|---|---|---|
| Problema | Sum | Scor | 80 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.56 kb |
#include<stdio.h>
#define N 100001
long long phi[N];
int n;
int x[N],max=0;
int main()
{
freopen("sum.in","r",stdin);
freopen("sum.out","w",stdout);
scanf("%d",&n);
for (int i=1;i<=n;i++)
{
scanf("%d",&x[i]);
if (x[i]>max)
max=x[i];
}
max=max*2;
for (int i=1;i<=max;i++) phi[i]=i;
for (int i=2;i<=max;i++)
if (phi[i]==i)
for (int j=i;j<=max;j+=i) phi[j] /=i, phi[j] *= (i-1);
for(int i=1;i<=n;i++)
printf("%lld\n",phi[x[i]]*2*x[i]);
return 0;
}
