BZOJ2154 Crash的数字表格

题目大意

给定n,m，求：

$$\sum_{i=1}^{n}\sum_{j=1}^{m}lcm(i,j)$$

Solution

令p=gcd(i,j)，且min{n,m}=n。

$$\sum_{i=1}^{n}\sum_{j=1}^{m}lcm(i,j)$$
$$=\sum_{p=1}^{n}\sum_{i=1}^{\lfloor\frac{n}{p}\rfloor}\sum_{j=1}^{\lfloor\frac{m}{p}\rfloor}ijp\cdot\varepsilon(gcd(i,j))$$
$$=\sum_{p=1}^{n}\sum_{i=1}^{\lfloor\frac{n}{p}\rfloor}\sum_{j=1}^{\lfloor\frac{m}{p}\rfloor}ijp\cdot\mu(gcd(i,j))*1$$
$$=\sum_{p=1}^{n}\sum_{i=1}^{\lfloor\frac{n}{p}\rfloor}\sum_{j=1}^{\lfloor\frac{m}{p}\rfloor}ijp\sum_{(d|i)\land(d|j)}\mu(d)$$
$$=\sum_{p=1}^{n}p\sum_{d=1}^{\lfloor\frac{n}{p}\rfloor}\mu(d)d^2\sum_{i=1}^{\lfloor\frac{n}{dp}\rfloor}i\sum_{j=1}^{\lfloor\frac{m}{dp}\rfloor}j$$
令q=dp,S(n)= $\sum_{i=1}^ni$
则原式= $$\sum_{q=1}^{n}qS(\lfloor\frac{n}{q}\rfloor)S(\lfloor\frac{m}{q}\rfloor)\sum_{d|q}\mu(d)d$$
令F(q)= $\sum_{d|q}\mu(d)d$
则原式= $$\sum_{q=1}^{n}qS(\lfloor\frac{n}{q}\rfloor)S(\lfloor\frac{m}{q}\rfloor)F(q)$$
其实F类似积性函数，可以用线性筛可以把它求出来。

代码

#include<cstdio>
#include<algorithm>
#define mo 20101009
using namespace std;
typedef long long ll;
int prime[10000010],flag[10000010];
ll F[10000010],S[10000010];
int main()
{
    int n,m,cnt=0;
    scanf("%d%d",&n,&m);
    flag[1]=1;
    int MAX=max(n,m);
    int MIN=min(n,m);
    F[1]=1;
    for (int i=2;i<=MAX;i++)
    {
        if (!flag[i])
            prime[++cnt]=i,F[i]=-i+1;
        for (int j=1;j<=cnt;j++)
        {
            if (prime[j]*i>MAX) break;
            flag[i*prime[j]]=1;
            if (i%prime[j]==0)
            {
                F[i*prime[j]]=F[i];
                break;
            }
            F[i*prime[j]]=F[i]*F[prime[j]]%mo;
        }
    }
    for (int i=1;i<=MAX;i++)
    {
        S[i]=S[i-1]+i;
        if (S[i]>=mo) S[i]-=mo;
    }
    ll ans=0;
    for (int q=1;q<=MIN;q++)
    {
        int n1=n/q,m1=m/q;
        ll sum=S[n1]*S[m1]%mo;
        sum*=q;
        sum%=mo;
        sum*=F[q];
        sum%=mo;
        sum=(sum+mo)%mo;
        ans+=sum;
        if (ans>=mo) ans-=mo;
    }
    printf("%lld\n",ans);
    return 0;
}