Pagini recente » Cod sursa (job #1538134) | Cod sursa (job #3231152) | Cod sursa (job #939323) | Cod sursa (job #3267765) | Cod sursa (job #448835)
Cod sursa(job #448835)
#include <cstdio>
#define N 100005
long long phi[1<<17],n,x;
void multiplu()
{
for (int i=1;i<=N;i++)
phi[i]=i;
for (int i=2;i<=N;i++)
if (phi[i]==i)
for (int j=i;j<=N;j+=i)
{
phi[j]/=i;
phi[j] *= (i-1);
}
}
void rez()
{
freopen("sum.in","r",stdin);
freopen("sum.out","w",stdout);
scanf("%lld",&n);
multiplu();
for(int k=1;k<=n;++k)
{
scanf("%lld",&x);
printf("%lld",(long long)phi[x]*x*2);
printf("\n");
}
}
int main()
{
rez();
return 0;
}