Pagini recente » Cod sursa (job #2467088) | Borderou de evaluare (job #2279215) | Borderou de evaluare (job #972015) | Cod sursa (job #2531265) | Cod sursa (job #336697)
Cod sursa(job #336697)
#include <cstdio>
#define N 100009
int main()
{int phi[100109],n,k,i,j;
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("%d",&k);
for (;k;--k)
{
scanf("%d",&n);
printf("%d\n",phi[n]*2*n);
}
return 0;}