Pagini recente » Cod sursa (job #1442332) | Cod sursa (job #144773) | Cod sursa (job #2990948) | Cod sursa (job #1925009) | Cod sursa (job #223638)
Cod sursa(job #223638)
#include <stdio.h>
#define max 1000005
int x,e[max];
void euler()
{
int j,i;
for (i=2; i<max; i++)
e[i]=i;
for (i=2; i<max; i++)
if (e[i]==i)
for (j=i; j<max; j+=i)
e[j]=e[j]/i*(i-1);
}
long long rez(int x)
{
long long suma=1;
suma=suma+2*e[x];
return suma;
}
int main()
{
freopen("sum.in","r",stdin);
freopen("sum.out","w",stdout);
int y,rez,n,i,fin;
scanf("%d",&n);
for (i=1; i<=n; i++)
{
fin=0;
scanf("%d",&x);
euler();
fin=rez(x)*x;
printf("%lld",&fin);
}
return 0;
}