没有卡常,,先不管
除了TLE其他全WA
#include <bits/stdc++.h>
#define N 1000001
#define int long long
using namespace std;
int t,n;
int phi[N],prime[N];
bool nprime[N];
void PHI(){
phi[1]=1;
for (int i=2;i<=N;i++){
if (!nprime[i]){
prime[++prime[0]]=i;
phi[i]=i-1;
}
for (int j=1;j<=prime[0]&&i*prime[j]<=N;j++){
nprime[i*prime[j]]=1;
if (i%prime[j]==0){
phi[i*prime[j]]=phi[i]*prime[j];
}
phi[i*prime[j]]=phi[i]*phi[prime[j]];
}
}
}
signed main(){
PHI();
for (cin>>t;t;t--){
cin>>n;
if (n==1){
cout<<"1\n";
continue;
}
int ans=0;
for (int i=1;i*i<=n;i++){//最最朴素的解法,,题解区找不到与此类似的代码,都是O(n log n)预处理的
if (n%i==0){
ans+=(phi[i]*i+1)/2;
if (i*i!=n){
ans+=phi[n/i]*(n/i)/2;
}
}
}
cout<<ans*n<<endl;
}
return 0;
}