Pagini recente » Cod sursa (job #2351269) | Istoria paginii runda/probleme_oji_clasa_9/clasament | Cod sursa (job #2518514) | Cod sursa (job #2895841) | Cod sursa (job #222770)
Cod sursa(job #222770)
#include<stdio.h>
#define lim 100001
int n,x,fi[100002];
void init()
{
int i,j;
for(i=2;i<=lim;i++)
fi[i]=i;
for(i=2;i<=lim;i++)
if(fi[i]==i)
for(j=i;j<=lim;j+=i)
fi[j]=fi[j]/i*(i-1);
}
int main()
{
freopen("sum.in","r",stdin);
freopen("sum.out","w",stdout);
scanf("%d",&n);
init();
while(n)
{
scanf("%d",&x);
printf("%d\n",(x<<1)*fi[x]);
n--;
}
return 0;
}