Cod sursa(job #336699)
| Utilizator | Data | 1 august 2009 11:31:34 | |
|---|---|---|---|
| Problema | Sum | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.41 kb |
#include <cstdio>
#define N 100009
int main()
{long long int phi[100109],n,k,i,j;
freopen("sum.in","r",stdin);
freopen("sum.out","w",stdout);
for (int i=1;i<=N;i++) phi[i]=i;
for (int i=2;i<=N;i++)
if (phi[i]==i)
for (j=i;j<=N;j+=i) phi[j] /=i, phi[j] *= (i-1);
scanf("%lld",&k);
for (;k;--k)
{
scanf("%lld",&n);
printf("%lld\n",phi[n]*2*n);
}
return 0;}