#莫比乌斯反演#BZOJ 4407 洛谷 4449 于神之怒加强版

题目

求$$\sum _{i=1}^n\sum _{j=1}^{m}gcd(i,j{)}^h(\mathrm{m}\mathrm{o}\mathrm{d}1000000007)$$

–

分析

$$=\sum _{d=1}^n{d}^h\sum _{i=1}^n\sum _{j=1}^m[gcd(i,j)==1]$$
然后就是$$\sum _{d=1}^n{d}^h\sum _{i=1}^{\lfloor \frac{n}{d}\rfloor }\sum _{j=1}^{\lfloor \frac{m}{d}\rfloor }\sum _{k|i,k|j}\mu (k)$$
$$\sum _{d=1}^n{d}^h\sum _{k=1}^{\lfloor \frac{n}{d}\rfloor }\mu (k)\lfloor \frac{n}{kd}\rfloor \lfloor \frac{m}{kd}\rfloor$$
枚举$i=kd$得到
$$\sum _{i=1}^n\lfloor \frac{n}{i}\rfloor \lfloor \frac{m}{i}\rfloor \sum _{d|i}{d}^h\mu (\frac{i}{d})$$
预处理后面的部分，时间复杂度$O(N+Tsqrt(n))$

---

代码

#include <cstdio>
#include <cctype>
#define rr register
using namespace std;
const int N=5000001,mod=1000000007;
int dp[N],prime[N],cnt,T,k; bool v[N];
inline signed iut(){
	rr int ans=0; rr char c=getchar();
	while (!isdigit(c)) c=getchar();
	while (isdigit(c)) ans=(ans<<3)+(ans<<1)+(c^48),c=getchar();
	return ans;
}
inline void print(int ans){
	if (ans>9) print(ans/10);
	putchar(ans%10+48);
}
inline signed min(int a,int b){return a<b?a:b;}
inline signed ksm(int x,int y){
	rr int ans=1;
	for (;y;y>>=1,x=1ll*x*x%mod)
	    if (y&1) ans=1ll*ans*x%mod;
	return ans;
}
inline signed mo(int x,int y){return x+y>=mod?x+y-mod:x+y;}
inline void init(){
	dp[1]=1;
	for (rr int i=2;i<N;++i){
		if (!v[i]) prime[++cnt]=i,dp[i]=mo(ksm(i,k)-1,mod);
		for (rr int j=1;prime[j]*i<N&&j<=cnt;++j){
			v[i*prime[j]]=1;
			if (i%prime[j]==0){
				dp[i*prime[j]]=1ll*dp[i]*(dp[prime[j]]+1)%mod;
				break;
			}
			dp[i*prime[j]]=1ll*dp[i]*dp[prime[j]]%mod;
		}
	}
	for (rr int i=2;i<N;++i) dp[i]=mo(dp[i],dp[i-1]);
}
signed main(){
	T=iut(); k=iut(); init();
	while (T--){
		rr int n=iut(),m=iut(),t=n<m?n:m,ans=0;
		for (rr int l=1,r;l<=t;l=r+1){
			r=min(n/(n/l),m/(m/l));
			ans=mo(ans,1ll*(dp[r]-dp[l-1]+mod)*(n/l)%mod*(m/l)%mod);
		}
		print(ans),putchar(10);
	}
	return 0;
}