Pagini recente » Borderou de evaluare (job #1588589) | Cod sursa (job #737355) | Cod sursa (job #88896) | Cod sursa (job #977488) | Cod sursa (job #484579)
Cod sursa(job #484579)
#include <stdio.h>
long long i,j,n,phi[100001],x;
int main()
{
freopen("sum.in","r",stdin);
freopen("sum.out","w",stdout);
scanf("%lld",&n);
for (i=1;i<100001;++i) phi[i] = i-1;
for (i=2;i<100001;++i)
for (j=2*i;j<100001;j+=i)
phi[j]-=phi[i];
for (j=1;j<=n;j++)
{
scanf("%lld",&x);
printf("%lld\n",2*x*phi[x]);
}
return 0;
}