Pagini recente » Istoria paginii runda/preoji_11-12_2/clasament | Cod sursa (job #1515580) | Cod sursa (job #2645879) | Cod sursa (job #514529) | Cod sursa (job #240840)
Cod sursa(job #240840)
#include<stdio.h>
#define N 500001
long long phi[N];
long n;
long x[N],max=0;
int main()
{
freopen("sum.in","r",stdin);
freopen("sum.out","w",stdout);
scanf("%ld",&n);
for (long i=1;i<=n;i++)
{
scanf("%ld",&x[i]);
if (x[i]>max)
max=x[i];
}
max=max*2;
for (long i=1;i<=max;i++) phi[i]=i;
for (long i=2;i<=max;i++)
if (phi[i]==i)
for (long j=i;j<=max;j+=i) phi[j] /=i, phi[j] *= (i-1);
for(long i=1;i<=n;i++)
printf("%lld\n",phi[x[i]]*2*x[i]);
return 0;
}