Pagini recente » Monitorul de evaluare | Monitorul de evaluare | Cod sursa (job #2534468) | Diferente pentru monthly-2014/runda-9/solutii intre reviziile 11 si 12 | Cod sursa (job #190019)
Cod sursa(job #190019)
#include <stdio.h>
#define max 100000
long phi[max+1],i,n;
long long j,x;
int main()
{
freopen("sum.in","r",stdin);
freopen("sum.out","w",stdout);
n=100000;
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]-=phi[j]/i;
scanf("%ld\n",&n);
phi[1]=0;
for (i=1; i<=n; ++i)
{ scanf("%lld\n",&x); j=x*phi[x] << 1; printf("%lld\n",j);}
fclose(stdin); fclose(stdout);
return 0;
}