Pagini recente » Cod sursa (job #342662) | Cod sursa (job #2564913) | Cod sursa (job #1681307) | Cod sursa (job #417771) | Cod sursa (job #216398)
Cod sursa(job #216398)
#include <stdio.h>
#define N 100005
int e[N];
void eulerith()
{
for (int i=1; i<=N; i++)
e[i]=i;
for (int i=2; i<=N; i++)
{
if (e[i]==i)
{
e[i]--;
for (int j=i+i; j<=N; j+=i)
e[j]=e[j]*i/(i-1);
}
}
}
void rezolvarith()
{
int x,t;
scanf("%d",&t);
for (int i=1; i<=t; i++)
{
scanf("%d",&x);
printf("%d\n",e[x]*x*2);
}
}
int main()
{
freopen("sum.in","r",stdin);
freopen("sum.out","w",stdout);
rezolvarith();
}