Pagini recente » Cod sursa (job #630134) | Cod sursa (job #1368718) | Cod sursa (job #1332542) | Cod sursa (job #1029746) | Cod sursa (job #1307436)
#include <stdio.h>
const int n_max = 100010;
const int N = 100010;
long long phi[n_max];
int main()
{
long long i, j, n, t;
freopen("sum.in","r",stdin);
freopen("sum.out","w",stdout);
for (int i=1;i<=N;i++)
phi[i]=i;
for (int i=2;i<=N;i++)
if (phi[i]==i)
for (j=i;j<=N;j+=i)
{
phi[j] /=i;
phi[j] *= (i-1);
}
scanf("%lld", &t);
for (i = 1; i <= t; ++ i)
{
scanf(" %lld ",&n);
printf("%lld\n", 2*n*phi[n]);
}
return 0;
}