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