Pagini recente » Cod sursa (job #2456448) | Cod sursa (job #2109668) | Cod sursa (job #902263) | Cod sursa (job #2229729) | Cod sursa (job #1865030)
#include <cstdio>
using namespace std;
long long v[100010],fi[100010];
long long n,i,j,mx,z;
int main()
{
freopen ("sum.in","r",stdin);
freopen ("sum.out","w",stdout);
scanf ("%lld",&n);
for (i=1;i<=n;++i)
{
scanf ("%lld",&v[i]);
if (v[i]>mx) mx=v[i];
}
// fi[1]=1;
for (i=2;i<=mx;++i)
{
fi[i]=i-1;
}
for (i=2;i<=mx;++i)
{
for (j=i+i;j<=mx;j+=i)
{
fi[j]-=fi[i];
}
}
for (i=1;i<=n;++i)
{
z=2*fi[v[i]]*v[i];
printf ("%lld\n",z);
}
return 0;
}