Pagini recente » Cod sursa (job #3147513) | Cod sursa (job #2989506) | Cod sursa (job #280797) | Cod sursa (job #2871166) | Cod sursa (job #238581)
Cod sursa(job #238581)
#include <stdio.h>
long long n,phi[100010];
long long sum;
int main()
{
long long T,i,j;
freopen("sum.in","r",stdin);
freopen("sum.out","w",stdout);
scanf("%lld", &T);
while (T--)
{
scanf("%lld", &n);
for (i=1;i<=n;++i)
phi[i]=i;
for (i=2;i<=n;++i)
if (phi[i]==i)
for (j=i;j<=n;j+=i)
{
phi[j]/=i;
phi[j]*=(i-1);
}
printf("%lld\n",2*n*phi[n]);
}
return 0;
}