51nod(1238 最小公倍数之和 V3 杜教筛)

题目
学习链接
学习链接

#include<cstdio>
#include<iostream>
#include<map>
using namespace std;
typedef long long ll;
const int N=5e6+5,mod=1e9+7,inv2=500000004,inv6=166666668;
int is[N+5],prime[N+5];
int phi[N+5];
void init(){
    phi[1]=1;int tot=0;
    for(int i=2;i<=N;++i){
        if(!is[i]) prime[++tot]=i,phi[i]=i-1;
        for(int j=1;j<=tot&&(ll)i*prime[j]<=N;++j){
            is[i*prime[j]]=1;
            if(i%prime[j]==0){
                phi[i*prime[j]]=phi[i]*prime[j]%mod;
                break;
            }
            phi[i*prime[j]]=phi[i]*(prime[j]-1)%mod;
        }
    }
    for(int i=2;i<=N;++i) phi[i]=(phi[i-1]+(ll)phi[i]*i%mod*i%mod)%mod;//phi[i]*i会爆int 呜呜可以(phi[i]=...)%=mod,...不会爆int
}
inline int cal1(ll x){//n*(n+1)/2
    return (x%mod)*((x+1)%mod)%mod*inv2%mod;
}
inline int cal2(ll x){//n*(n+1)*(2*n+1)/6
    return (x%mod)*((x+1)%mod)%mod*((2*x+1)%mod)%mod*inv6%mod;
}
inline int cal3(ll x){//(n*(n+1)/2)^2
    ll res=cal1(x);
    return res*res%mod;
}
map<int,int>ans_phi_i;
inline int f_phi_i(ll n){
    if(n<=N) return phi[n];
    if(ans_phi_i[n]) return ans_phi_i[n];
    ll res=cal3(n);
    for(ll l=2,r;l<=n;l=r+1)
        r=n/(n/l),(res-=(ll)(cal2(r)-cal2(l-1))%mod*f_phi_i(n/l)%mod)%=mod;//乘法会爆int  2e9*1e9会爆ll吗 先对(ll)(cal2(r)-cal2(l-1))取模
    return ans_phi_i[n]=(res+mod)%mod;
}
int main(){
    init();
    ll n,ans=0;scanf("%lld",&n);
    for(ll l=1,r;l<=n;l=r+1)
        r=n/(n/l),(ans+=((ll)(cal1(r)-cal1(l-1))%mod*f_phi_i(n/l))%mod)%=mod;//乘法会爆int
    printf("%lld\n",(ans+mod)%mod);
}