思路:
代码
#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int N=1e6+7;
int primes[N],cnt;
ll euler[N];
bool st[N];
ll ans[N];
void get_eulers(int n)
{
euler[1] = 1;
for (int i = 2; i <= n; i ++ )
{
if (!st[i])
{
primes[cnt ++ ] = i;
euler[i] = i - 1;
}
for (int j = 0; primes[j] <= n / i; j ++ )
{
int t = primes[j] * i;
st[t] = true;
if (i % primes[j] == 0)
{
euler[t] = euler[i] * primes[j];
break;
}
euler[t] = euler[i] * (primes[j] - 1);
}
}
for(int i=1;i<=N;i++)
{
for(int j=1;j*i<=N;j++)
{
ans[i*j]+=1ll*euler[j]*j/2;
}
}
for(int i=1;i<=N;i++)
{
ans[i]++;
ans[i]*=i;
}
}
int main()
{
int t;scanf("%d",&t);
get_eulers(N);
while(t--)
{
int n;scanf("%d",&n);
printf("%lld\n",ans[n]);
}
}