Pagini recente » Cod sursa (job #283544) | fmi-no-stress-2012/solutii/costperm | Istoria paginii runda/simulare_oji_2023_clasa_9_16_martie | Cod sursa (job #928898) | Cod sursa (job #487846)
Cod sursa(job #487846)
#include<stdio.h>
int n,m;
long long phi[100002];
int main()
{ int i,j;
freopen("sum.in","r",stdin);
freopen("sum.out","w",stdout);
scanf("%d",&n);
for(i=1;i<=100000;++i)
phi[i]=i-1;
for(i=2;i<=100000;++i)
for(j=2*i;j<=100000;j+=i)
phi[j] -= phi[i];
for(;n;--n)
{ scanf("%d",&m);
printf("%lld\n",2*m*phi[m]);
}
return 0;
}