Pagini recente » Cod sursa (job #2970867) | Cod sursa (job #7118) | Cod sursa (job #1535676) | Cod sursa (job #1122061) | Cod sursa (job #1863818)
#include<bits/stdc++.h>
using namespace std;
int n,m;
int phi[100005],x[100005];
int main()
{
freopen("sum.in","r",stdin);
freopen("sum.out","w",stdout);
scanf("%d",&n);
for(int i=1;i<=n;i++)
{
scanf("%d",&x[i]);
m=max(m,x[i]);
}
for(int i=2;i<=m;i++) phi[i]=i;
for(int i=2;i<=m;i++)
{
if(phi[i]==i)
for(int j=i;j<=m;j+=i)
{
phi[j]=phi[j]/i*(i-1);
}
}
for(int i=1;i<=n;i++)
{
printf("%lld\n",2LL*x[i]*phi[x[i]]);
}
return 0;
}