Cod sursa(job #238584)
| Utilizator | Data | 2 ianuarie 2009 17:30:11 | |
|---|---|---|---|
| Problema | Sum | Scor | 50 |
| Compilator | c | Status | done |
| Runda | Arhiva de probleme | Marime | 0.55 kb |
#include <stdio.h>
int n;
long long phi[100010];
long long sum;
int main()
{
int T,i,j;
freopen("sum.in","r",stdin);
scanf("%d", &T);
freopen("sum.out","w",stdout);
while (T--)
{
scanf("%d", &n);
for (i=1;i<=n;++i) phi[i]=i;
for (i=2;i<=n;++i)
if (phi[i]==i)
for (j=i;j<=n;j+=i)
{
phi[j]/=i;
phi[j]*=(i-1);
}
printf("%lld\n",2*n*phi[n]);
}
return 0;
}
