Pagini recente » Cod sursa (job #3147695) | Cod sursa (job #642007) | Cod sursa (job #1060524) | Cod sursa (job #2784666) | Cod sursa (job #379036)
Cod sursa(job #379036)
#include <stdio.h>
#define Max 100000
int n;
long long phi[100010];
long long sum;
void totient(int n)
{
int i,j;
for (i=2;i<=Max;++i) phi[i]=i;
for (i=2;i<=Max;++i)
if (phi[i]==i)
for (j=i;j<=Max;j+=i)
{
phi[j]/=i;
phi[j]*=(i-1);
}
}
int main()
{
int T;
totient(n);
freopen("sum.in","r",stdin);
scanf("%d", &T);
freopen("sum.out","w",stdout);
while (T--)
{
scanf("%d", &n);
printf("%lld\n",2*n*phi[n]);
}
return 0;
}