2019ICPC南京网络赛E题 K Sum

题意：

数学题见链接

数据范围：

n=1e9，k=10^1e5

链接：

https://nanti.jisuanke.com/t/41304

题解：

涉及积性函数、莫比乌斯反演、杜教筛（狄利克雷卷积）、等比数列求和、欧拉降幂、数论分块 以及推式子的能力。

#include<iostream>
#include<algorithm>
#include<unordered_map>
using namespace std;
#define ll long long
const ll mod=1e9+7;
const ll inv6=(mod+1)/6;

const int maxn=4e6;
ll P[maxn],cnt;bool vis[maxn];
ll f[maxn];
unordered_map<int,int> S;

void init(){
    f[1]=1;
    for(int i=2;i<maxn;i++){
        if(!vis[i])P[cnt++]=i,f[i]=(1ll*i*i-1)%mod;
        for(int j=0;j<cnt&&i*P[j]<maxn;j++){
            int now=P[j]*i;vis[now]=1;
            if(i%P[j]==0){
                f[now]=f[i]*P[j]%mod*P[j]%mod;
                break;
            }
            else f[now]=f[i]*((P[j]*P[j]-1)%mod)%mod;
        }
    }
    for(int i=1;i<maxn;i++)f[i]=(f[i]+f[i-1])%mod;
}

ll getS(ll x){
    if(x<maxn)return f[x];
    if(S[x])return S[x];
    ll ret=x*(x+1)%mod*(((x<<1)+1)*inv6%mod)%mod;
    for(int i=2,j;i<=x;i=j+1){
        j=x/(x/i);
        ret-=getS(x/i)*(j-i+1);
    }
    return S[x]=(ret%=mod)<0?ret+mod:ret;
}


ll mypow(ll a,ll b){
    ll ret=1;
    while(b){
        if(b&1)ret=ret*a%mod;
        a=a*a%mod;b>>=1;
    }
    return ret;
}

int main(){

    init();
    int t;cin>>t;
    while(t--){
        int n;cin>>n;
        ll k1=0,k2=0;char b=getchar();
        while(!('0'<=b&&b<='9'))b=getchar();
        while('0'<=b&&b<='9'){
            k1=(k1<<3)+(k1<<1)+b-'0';
            k2=(k2<<3)+(k2<<1)+b-'0';
            if(k1>=mod-1)k1%=mod-1;
            if(k2>=mod)k2%=mod;
            b=getchar();
        }

        //cout<<"n k "<<n<<" "<<k<<endl;

        //for(int i=1;i<=20;i++)cout<<i<<" "<<f[i]<<endl;

        //k1+=mod-1;
        //k2+=mod;

        ll ans=0;
        for(int i=1,j;i<=n;i=j+1){
            j=n/(n/i);
            ll x=n/i;

            ll tmp=0;
            if(x==1)tmp=(k2-1);
            else tmp=x*x%mod*((1-mypow(x,k1+mod-2))*mypow(1-x,mod-2)%mod)%mod;

            //cout<<(1-mypow(x,k+mod-2))<<" "<<mypow(1-x,mod-2)<<endl;
            //cout<<i<<" "<<j<<" "<<tmp<<" "<<(getS(j)-getS(i-1))<<endl;

            ans+=tmp*(getS(j)-getS(i-1))%mod;
        }
        ans=(ans%mod+mod)%mod;
        cout<<ans<<endl;
    }
}