某 SCOI 模拟赛 T2 LCM【杜教筛】

题意

$$\sum _{i=1}^n\sum _{j=1}^m\mathrm{lcm}(i,j,i+j)$$

$n,m\le 10^{10}$，3s。

题解

设 $n<m$

$$\begin{array}{rl}\text{原式}=& \sum _{g=1}^{\min (m,n)}\sum _{i=1}^{n/g}\sum _{j=1}^{n/g}gij(i+j)[gcd(i,j)=1]\\ =& \sum _{g=1}^{n}g\sum _{i=1}^{n/g}\sum _{j=1}^{n/g}ij(i+j)\sum _{d\mid \gcd (i,j)}\mu (d)\\ =& \sum _{g=1}^{n}g\sum _{d=1}^{n/g}\mu (d)\sum _{i=1}^{m/(dg)}\sum _{j=1}^{n/(dg)}{d}^{3}ij(i+j)\end{array}$$

记 $$\begin{array}{rl}f(n,m)=& \sum _{i=1}^n\sum _{j=1}^{m}ij(i+j)\\ =& (\sum _{i=1}^n\sum _{j=1}^m{i}^{2}j)+(\sum _{i=1}^n\sum _{j=1}^{m}i{j}^2)\\ =& (\sum i^2)(\sum j)+(\sum i)(\sum j^2)\\ =& \frac{n(n+1)(2n+1)}{6}\frac{m(m+1)}{2}+\frac{n(n+1)}{2}\frac{m(m+1)(2m+1)}{6}\\ =& \frac{1}{6}nm(n+1)(m+1)(n+m+1)\end{array}$$

---

$$\begin{array}{rl}\text{原式}=& \sum _{g=1}^{n}g\sum _{d=1}^{n/g}\mu (d)\sum _{i=1}^{n/(dg)}\sum _{j=1}^{n/(dg)}{d}^{3}ij(i+j)\\ =& \sum _{g=1}^{n}g\sum _{d=1}^{n/g}{d}^3\mu (d)f(n/(dg),m/(dg))\\ =& \sum _{T=1}^{n}f(n/T,m/T)\sum _{g|T}g\cdot \mu (\frac{T}{g})\cdot (\frac{T}{g}{)}^3\\ =& \sum _{T=1}^{n}f(n/T,m/T)(Id\ast (\mu \cdot I{d}^3))(T)\end{array}$$

先整除分块，然后计算 $Id\ast (\mu \cdot I{d}^3)$ 的前缀和。卷上 $I{d}^3$ 后等于 $Id\ast ϵ=Id$，杜教筛即可。

#include<bits/stdc++.h>
using namespace std;
#define ll long long
ll getint(){
	ll ans=0,f=1;
	char c=getchar();
	while(c<'0'||c>'9'){
		if(c=='-')f=-1;
		c=getchar();
	}
	while(c>='0'&&c<='9'){
		ans=ans*10+c-'0';
		c=getchar();
	}
	return ans*f;
}
const int mod=1000000007;
const int inv2=(mod+1)/2,inv3=(mod+1)/3;
const int inv6=inv2*1ll*inv3%mod;

const int N=6e6;
int pri[N+10],sg[N+10],cnt=0;
bool boo[N+10];
int lim=0;
void init(int N){
	lim=N;
	sg[1]=1;
	for(int i=2;i<=N;i++){
		if(!boo[i]){
			pri[cnt++]=i;
			sg[i]=(mod-i*1ll*i%mod*i%mod+i)%mod;
		}
		for(int j=0;j<cnt&&i*pri[j]<=N;j++){
			boo[i*pri[j]]=1;
			if(i%pri[j]){
				sg[i*pri[j]]=(sg[i]*1ll*sg[pri[j]])%mod;
			}else{
				sg[i*pri[j]]=(sg[i]*1ll*pri[j])%mod;
			}
		}
	}
	for(int i=1;i<=N;i++){
		sg[i]+=sg[i-1];
		if(sg[i]>=mod)sg[i]-=mod;
	}
}

unordered_map<ll,int>sumg;
inline int sum_id(ll x){
	x%=mod;
	return (x*(x+1ll)/2%mod);
}
inline int sum_i(ll x){
	return sum_id(x)*1ll*sum_id(x)%mod;
}
inline int f(ll n,ll m){
	n%=mod;m%=mod;
	return inv6*1ll*n%mod*m%mod*(n+1)%mod*(m+1)%mod*(n+m+1)%mod;
}
int calc(ll x){
	if(x==0)return 0;
	if(x<=lim)return sg[x];
	auto it=sumg.find(x);
	if(it!=sumg.end())return it->second;
	int sum=sum_id(x);
	int lst=1;
	for(ll l=2,r=0;l<=x;l=r+1){
		ll t=x/l;r=x/t;
		int sr=sum_i(r);
		sum=(sum+mod-(sr-lst+mod)*1ll*calc(t)%mod);
		if(sum>=mod)sum-=mod;
		lst=sr;
	}
	return sumg[x]=sum;
}
int main(){
	//freopen("lcm.in","r",stdin);
	//freopen("lcm.out","w",stdout);
	ll n=getint(),m=getint();
	init(min(N,(int)pow(min(n,m),0.7)));
	int ans=0,lst=0;
	//for(int i=1;i<=20;i++)cerr<<i<<" "<<(mod+calc(i)-calc(i-1))%mod<<endl;
	for(ll l=1,r=0;l<=min(n,m);l=r+1){
		r=min(n/(n/l),m/(m/l));
		int cr=calc(r);
		ans=(ans+(cr-lst+mod)*1ll*f(n/l,m/l)%mod);
		if(ans>=mod)ans-=mod;
		lst=cr;
	}
	cout<<ans;
	return 0;
}