LCM Sum

题目：
https://www.luogu.com.cn/problem/SP5971

求${\sum }_{i=1}^{n}lcm(i,n)n\le 10^6$

思路：
$$\begin{array}{rl}& \sum _{i=1}^{n}lcm(i,n)\\ =& \sum _{i=1}^n\frac{i\ast n}{(i,n)}\\ =& \sum _{d=1}^n\sum _{i=1}^n\frac{i\ast n}{d}[(i,n)=d]另i=k\ast d\\ =& \sum _{d|n}\sum _{k=1}^{\frac{n}{d}}k\ast n[(k,\frac{n}{d})=1]有\sum _{i=1}^{n}i[(i,n)=1]=\frac{\phi (n)\ast n}{2}\\ =& n\sum _{d|n}\frac{\phi (\frac{n}{d})\ast \frac{n}{d}}{2}\\ =& n\sum _{d|n}\frac{\phi (d)\ast d}{2}\end{array}$$
线性筛

#include <cstdio>
const int N=1000000;
int tot,p[N+5],phi[N+5];
long long ans[N+5];
bool flg[N+5];

void solve() {
    phi[1]=1;
    for(int i=2;i<=N;++i) {
        if(!flg[i]) p[++tot]=i,phi[i]=i-1;
        for(int j=1;j<=tot&&i*p[j]<=N;++j) {
            flg[i*p[j]]=1;
            if(i%p[j]==0) {
                phi[i*p[j]]=phi[i]*p[j];
                break;
            }
            phi[i*p[j]]=phi[i]*(p[j]-1);
        }
    }
    for(int i=1;i<=N;++i) {
        for(int j=1;i*j<=N;++j) {
            ans[i*j]+=1LL*j*phi[j]/2;
        }
    }
    for(int i=1;i<=N;++i) ans[i]=1LL*i*ans[i]+i;
}
int main() {
    int T,n;
    solve();
    for(scanf("%d",&T);T;--T) {
        scanf("%d",&n);
        printf("%lld\n",ans[n]);
    }
    return 0;
}