Pagini recente » Cod sursa (job #2545795) | Cod sursa (job #3128125) | Clasament fmi-no-stress-2012 | Cod sursa (job #2257404) | Cod sursa (job #466015)
Cod sursa(job #466015)
#include<stdio.h>
int v[101060];
long long N,S;
int main()
{
freopen("sum.in","r",stdin);
freopen("sum.out","w",stdout);
scanf("%lld",&N);
for(int i=2;i<=101010;++i)
{
if(v[i]==0)
{
v[i]=i-1;
for(int j=i*2;j<=101010;j=j+i)
{
if(v[j]==0)
v[j]=j-(j/i);
else
v[j]=v[j]-(v[j]/i);
}
}
}
S=1;
v[1]=1;
int x;
for(int i=1;i<=N;++i)
{
scanf("%d",&x);
printf("%lld\n",(long long)v[x]*x*2);
}
return 0;
}