Pagini recente » Cod sursa (job #2788341) | Cod sursa (job #1326680) | Cod sursa (job #553966) | Cod sursa (job #1529869) | Cod sursa (job #1334576)
#include <cstdio>
using namespace std;
int phi[1000005];
void ciur(int n)
{
for (register int i=1;i<=n;++i)
phi[i]=i;
for (register int i=2;i<=n;++i)
if (phi[i]==i)
{
for (register int j=2*i;j<=n;j+=i)
phi[j]=phi[j]/i*(i-1);
phi[i]=i-1;
}
}
int main()
{
freopen("sum.in","r",stdin);
freopen("sum.out","w",stdout);
int t,n;
scanf("%d",&t);
ciur(200005);
for (register int i=1;i<=t;++i)
{
scanf("%d",&n);
printf("%lld\n",(long long)2*n*phi[n]);
}
return 0;
}