反演+分块套分块——bzoj2154

题解都在论文里了

#include<bits/stdc++.h>
using namespace std;
#define maxn 10000005
#define ll long long
#define mod 20101009
 
bool vis[maxn];
int sum[maxn],prime[maxn],mm,mu[maxn];
void primes(){
    mu[]=;
    for(int i=;i<maxn;i++){
        if(!vis[i]){
            prime[++mm]=i;
            mu[i]=-;
        }
        for(int j=;j<=mm;j++){
            if(i*prime[j]>=maxn)break;
            vis[i*prime[j]]=;
            if(i%prime[j]==){
                mu[i*prime[j]]=;
                break;
            }
            else mu[i*prime[j]]=-mu[i];
        }
    }
    for(int i=;i<maxn;i++)
        sum[i]=(sum[i-]+(ll)mu[i]*i%mod*i%mod)%mod;
}
ll n,m;
 
inline ll Sum(ll n,ll m){
    ll res1=((+n)*n/)%mod;
    ll res2=((+m)*m/)%mod;
    return res1*res2%mod;
}
inline ll F(ll n,ll m){
    ll res=;
    if(n>m)swap(n,m);
    for(int l=,r;l<=n;l=r+){
        r=min(n/(n/l),m/(m/l));
        ll tmp=((sum[r]-sum[l-])%mod+mod)%mod;
        res=(res+tmp*Sum(n/l,m/l)%mod)%mod;
    }
    return res;
}
 
int main(){
    primes();
 
    scanf("%lld%lld",&n,&m);
    if(n>m)swap(n,m);
    ll ans=;
    for(int l=,r;l<=n;l=r+){
        r=min(n/(n/l),m/(m/l));
        ll tmp=(ll)(l+r)*(r-l+)/%mod;
        ans=(ans+tmp*F(n/l,m/l)%mod)%mod;
    }
    cout<<ans<<endl;
}