【2011集训队出题】【BZOJ 2154】【JZOJ 1938】Crash的数字表格

Description

求

$$\sum_{i=1}^n\sum_{j=1}^mlcm(i,j)$$
$n,m\leq 10^7$

Analysis

设$n\leq m$
变形

$$\sum_{i=1}^n\sum_{j=1}^m\dfrac{ij}{gcd(i,j)}$$
设 $$f(d)=\sum_{i=1}^n\sum_{j=1}^mij\ [gcd(i,j)=d]$$
反演
$$f(d)=\sum_{i=1}^{\lfloor\dfrac{n}{d}\rfloor}\mu(i)i^2d^2\dfrac{\lfloor\dfrac{n}{id}\rfloor(\lfloor\dfrac{n}{id}\rfloor+1)\lfloor\dfrac{m}{id}\rfloor(\lfloor\dfrac{m}{id}\rfloor+1)}{4}$$
显然 $f(d)$可以分块计算
$$Ans=\sum_{d=1}^n\dfrac{f(d)}{d}$$
同理，外面也可以分块，所以总的时间复杂度是 $O(n)$

Code

#include<cstdio>
#include<algorithm>
#define fo(i,a,b) for(ll i=a;i<=b;i++)
using namespace std;
typedef long long ll;
const int N=int(1e7)+10,mo=20101009,ny2=10050505,ny4=15075757;
int s[N],mu[N],pri[N];
ll n,m,ans; 
bool bz[N];
void pre(int n)
{
    mu[1]=1;
    fo(i,2,n)
    {
        if(!bz[i]) pri[++pri[0]]=i,mu[i]=-1;
        fo(j,1,pri[0])
        {
            int t=i*pri[j];
            if(t>n) break;
            bz[t]=1;
            if(i%pri[j]==0) mu[t]=0;
            else mu[t]=-mu[i];
        }
    }
    fo(i,1,n) s[i]=((ll)(i*i%mo*mu[i]%mo+mo)%mo+s[i-1]+mo)%mo;
}
ll sum(ll n,ll m)
{
    return n*(n+1)%mo*m%mo*(m+1)%mo;
}
int main()
{
    scanf("%lld %lld",&n,&m);
    if(n>m) swap(n,m);
    pre(n);
    ll d1;
    for(ll d=1;d<=n;d=d1+1)
    {
        d1=min(n/(n/d),m/(m/d));
        ll n1=n/d,m1=m/d,j,t=0;
        for(ll i=1;i<=n1;i=j+1)
        {
            j=min(n1/(n1/i),m1/(m1/i));
            t=(t+(s[j]-s[i-1]+mo)*sum(n1/i,m1/i)%mo+mo)%mo;
        }
        ans=(ans+((d+d1)*(d1-d+1)%mo*ny2%mo)%mo*t%mo*ny4%mo)%mo;
    }
    printf("%lld",ans);
    return 0;
}