Pagini recente » Cod sursa (job #1824499) | Cod sursa (job #403000) | Cod sursa (job #35337) | Cod sursa (job #2367189) | Cod sursa (job #270203)
Cod sursa(job #270203)
#include<stdio.h>
#define N 110000
int n, phi[N];
void phi2(){
for(int i=1; i<=N; ++i)
phi[i]=i;
for(int i=2; i<=N;++i)
if(phi[i]==i){
for(int j=i; j<=N;j+=i){
phi[j]/=i;
phi[j]*=i-1;
}
}
}
int main(){
freopen("sum.in","r", stdin);
freopen("sum.out", "w", stdout);
int x;
long long s;
phi2();
scanf("%d", &x);
for(int a=1; a<=x; ++a){
scanf("%d", &n);
s=2*(long long)n*phi[n];
printf("%lld\n",s);
}
return 0;
}