洛谷 P3704 ：[SDOI2017]数字表格（莫比乌斯反演）

---

题目让你求${\prod }_{i=1}^n{\prod }_{j=1}^{m}f[gcd(i,j)]$
化简一下式子，枚举一下 gcd：$$\prod _{d=1}^n\prod _{i=1}^n\prod _{j=1}^{m}f[d]\ast [gcd(i,j)=d]=\prod _{d=1}^{n}f(d{)}^{{\sum }_{i=1}^n{\sum }_{j=1}^m[gcd(i,j)=d]}$$观察这个式子，$f(d)$的指数部分可以拿出来反演化简了：$$\sum _{i=1}^n\sum _{j=1}^m[gcd(i,j)=d]=\sum _{i=1}^{\lfloor \frac{n}{d}\rfloor }\sum _{j=1}^{\lfloor \frac{m}{d}\rfloor }[gcd(i,j)=1]$$
$$令f(p)=\sum _{i=1}^{\lfloor \frac{n}{d}\rfloor }\sum _{j=1}^{\lfloor \frac{m}{d}\rfloor }[gcd(i,j)=p]$$
$$F(x)=\sum _{x|p}f[p]=\sum _{i=1}^{\lfloor \frac{n}{d}\rfloor }\sum _{j=1}^{\lfloor \frac{m}{d}\rfloor }[x|gcd(i,j)]$$
$$反演一下：f(p)=\sum _{p|x}\mu (\frac{x}{p})\ast F(x)，f(1)=\sum _{x=1}^{\lfloor \frac{n}{d}\rfloor }\mu (x)\ast F(x)=\sum _{x=1}^{\lfloor \frac{n}{d}\rfloor }\mu (x)\ast \lfloor \frac{n}{x\ast d}\rfloor \ast \lfloor \frac{m}{x\ast d}\rfloor$$
化简到这个程度可以$O(n\sqrt{n})$预处理指数部分，然后每次询问分块，用欧拉降幂加快速幂在$O(T\ast \sqrt{n}\ast log(mod))$时间内完成单组询问，但$n\le 10^6，O(n\ast \sqrt{n})$不够通过此题，继续化简，将指数部分枚举 x 的地方拿下来：$$\begin{gathered} \prod _{d=1}^{n}f(d{)}^{{\sum }_{x=1}^{\lfloor \frac{n}{d}\rfloor }\mu (x)\ast \lfloor \frac{n}{x\ast d}\rfloor \ast \lfloor \frac{m}{x\ast d}\rfloor }=\prod _{d=1}^n\prod _{x=1}^{\lfloor \frac{n}{d}\rfloor }f(d{)}^{ \\ mu(x)\ast \lfloor \frac{n}{x\ast d}\rfloor \ast \lfloor \frac{m}{x\ast d}\rfloor } \end{gathered}$$
令 $T=x\ast d$，改变枚举项：$$\begin{gathered} \prod _{T=1}^n\prod _{d|T}f(d{)}^{ \\ mu(\frac{T}{d})\ast \lfloor \frac{n}{T}\rfloor \ast \lfloor \frac{m}{T}\rfloor } \end{gathered}$$
令 $S(T)={\prod }_{d|T}f(d{)}^{\mu (\frac{T}{d})}$，可以$O(n\ast logn)$预处理得到 S函数。
$$\prod _{T=1}^{n}S(T{)}^{\lfloor \frac{n}{T}\rfloor \ast \lfloor \frac{m}{T}\rfloor }$$
预处理一下S函数前缀乘积和逆元，再分下块，每次询问$O(\sqrt{n}\ast log(mod))$解决，总复杂度$O(n\ast logn+T\ast \sqrt{n}\ast log(mod))$

---

代码：

#include<bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
const int maxn = 2e6 + 10;
typedef long long ll;
ll fpow(ll a,ll b) {
	ll r = 1;
	while(b) {
		if(b & 1) r = r * a % mod;
		a = a * a % mod;
		b >>= 1;
	}
	return r;
}
bool ispri[maxn];
int pri[maxn],mu[maxn];
ll ans[maxn],inv[maxn];
int f[maxn];
int t,n,m;
void sieve(int n) {
	ispri[0] = ispri[1] = true;
	pri[0] = 0;mu[1] = 1;
	for(int i = 2; i <= n; i++) {
		if(!ispri[i]) pri[++pri[0]] = i,mu[i] = -1;
		for(int j = 1; j <= pri[0] && i * pri[j] <= n; j++) {
			ispri[i * pri[j]] = true;
			if(i % pri[j] == 0) break;
			mu[i * pri[j]] = -mu[i];
		}
	}
	for(int i = 0; i <= n; i++) ans[i] = 1;
	f[1] = f[2] = 1;
	for(int i = 3; i <= n; i++)
		f[i] = (f[i - 1] + f[i - 2]) % mod;
	for(int i = 1; i <= n; i++)
		inv[i] = fpow(f[i],mod - 2);
	for(int i = 1; i <= n; i++) {
		for(int j = 1; j * i <= n; j++) {
			if(mu[j] == -1)
				ans[i * j] = ans[i * j] * inv[i] % mod;
			else if(mu[j] == 1)
				ans[i * j] = ans[i * j] * f[i] % mod;
		}
	}
	for(int i = 1; i <= n; i++)
		ans[i] = ans[i] * ans[i - 1] % mod;
	for(int i = 0; i <= n; i++)
		inv[i] = fpow(ans[i],mod - 2);		
}
int main() {
	sieve(1000000);
	scanf("%d",&t);
	while(t--) {
		scanf("%d%d",&n,&m);
		int l,r;
		ll res = 1;
		if(n > m) swap(n,m);
		for(l = 1; l <= n; l = r + 1) {
			r = min(n / (n / l),m / (m / l));
			ll p1 = n / l,p2 = m / l;
			ll tmp = ans[r] * inv[l - 1] % mod;
			res = res * fpow(tmp,p1 * p2 % (mod - 1)) % mod;
		}
		printf("%lld\n",res);
	}
	return 0;
}