BZOJ2694 Lcm【莫比乌斯反演】

传送门(darkbzoj)

---

SOL

我们要享受推式子的过程嘛，所以这里给出结果式。
$$\sum _{T=1}^{min(n,m)}f([\frac{n}{T}])f([\frac{m}{T}])T\sum _{d|T}u(d)g(\frac{T}{d})d$$
其中
$$f(i)=\sum _{j=1}^{i}j,g(i)=[i没有平方因子]。$$
令
$$G(i)=u(i)i,F(i)=G\ast g(i)。$$
积性函数相乘为积性函数，卷积后也为积性函数，线性筛即可

---

CODE

#include<bits/stdc++.h>
using namespace std;
#define sf scanf
#define pf printf
#define cs const
#define ll long long
#define ri register int
inline int red()
{
    int data=0;int w=1; char ch=0;
    ch=getchar();
    while(ch!='-' && (ch<'0' || ch>'9')) ch=getchar();
    if(ch=='-') w=-1,ch=getchar();
    while(ch>='0' && ch<='9') data=(data<<3)+(data<<1)+ch-'0',ch=getchar();
    return data*w;
}
#define in red()
cs int N=4e6+10,lim=4e6,mod=1073741824;
ll F[N],sum[N],f[N];
int p[N],top,mn[N];
bool vis[N];
inline void init(){
	F[1]=1;f[1]=1;sum[1]=1;
	for(ri i=2;i<=lim;++i){
		if(!vis[i])p[++top]=i,F[i]=1-i+mod,mn[i]=i;
		for(ri j=1,tmp=i*p[j];j<=top&&1ll*p[j]*i<=lim;++j,tmp=i*p[j]){
			vis[tmp]=1;
			if(i%p[j]==0){
				int q=i/mn[i];
				mn[tmp]=mn[i]*p[j];
				if(mn[i]==p[j])F[tmp]=F[q]*(-p[j]);
				break;
			}
			mn[tmp]=p[j];
			F[tmp]=F[i]*F[p[j]]%mod; 
		} 
		sum[i]=(1ll*i*F[i]%mod+1ll*sum[i-1])%mod;
		f[i]=1ll*(i+1)*i/2%mod;
	}
} 
inline void calc(int a,int b){
	ll ans=0;
	for(int i=1,j,up=min(a,b);i<=up;i=j+1){
		j=min(a/(a/i),b/(b/i));
		ans+=1ll*(sum[j]-sum[i-1])*f[a/i]%mod*f[b/i]%mod;
		if(ans>mod)ans-=mod;
		if(ans<0)ans+=mod;
	} 
	cout<<ans<<'\n';
}

signed main(){
	freopen("data.in","r",stdin);
	init();
	int t=in;
	while(t--)calc(in,in);
	return 0;
}