Pagini recente » Cod sursa (job #1626928) | Cod sursa (job #788438) | Cod sursa (job #2601200) | Diferente pentru problema/ismquery intre reviziile 21 si 22 | Cod sursa (job #1205746)
#include<stdio.h>
long long N,X,phi[100005];
int main() {
freopen("sum.in","r",stdin);
freopen("sum.out","w",stdout);
long long i,j;
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];
scanf("%d",&N);
for(i=1;i<=N;i++){
scanf("%d",&X);
printf("%d",2*phi[X]*X);
printf("\n");
}
return 0;
}