Cod sursa(job #1606785)
Utilizator | Data | 20 februarie 2016 15:48:22 | |
---|---|---|---|
Problema | Sum | Scor | 70 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.37 kb |
#include<cstdio>
int n,x,y,i,j,p,up,fi[100001];
char ciur[100001];
int main ()
{
freopen("sum.in","r",stdin);
freopen("sum.out","w",stdout);
scanf("%d",&n);
for(i=2;i<=100000;i++)
fi[i]=i-1;
for(i=2;i<=100000;i++)
for(j=i*2;j<=100000;j+=i)
fi[j]-=fi[i];
for(i=1;i<=n;i++)
{
scanf("%d",&x);
printf("%d\n",x*fi[x]*2);
}
return 0;
}