【luogu P5518】[MtOI2019]幽灵乐团 / 莫比乌斯反演基础练习题（莫比乌斯反演）

[MtOI2019]幽灵乐团 / 莫比乌斯反演基础练习题

题目链接：luogu P5518

题目大意

$\prod _{i=1}^A\prod _{j=1}^B\prod _{k=1}^C(\frac{\text{lcm}(i,j)}{\gcd (i,k)}{)}^{f(type)}$
多组数据，要你在 $f(type)$ 分别是 $1,i\times j\times k,\gcd (i,j,k)$ 的时候求式子的值。

思路

主要的思想是对于每个部分你就求两个东西：
$\prod _{i=1}^A\prod _{j=1}^B\prod _{k=1}^C{i}^{f(type)}$
$\prod _{i=1}^A\prod _{j=1}^B\prod _{k=1}^C\gcd (i,j{)}^{f(type)}$

不多说了直接看我推导过程吧！
$\prod _{i=1}^A\prod _{j=1}^B\prod _{k=1}^C(\frac{\text{lcm}(i,j)}{\gcd (i,k)}{)}^{f(type)}$

---

求 $\prod _{i=1}^n\prod _{j=1}^m\gcd (i,j)$
$\prod _d{d}^{\sum _{i=1}^n\sum _{j=1}^m[\gcd (i,j)==d]}$

$O(n\log n)$

---

$type=1$
$\prod _{i=1}^A\prod _{j=1}^B\prod _{k=1}^C\frac{\text{lcm}(i,j)}{\gcd (i,k)}$
$\prod _{i=1}^A\prod _{j=1}^B\prod _{k=1}^C\frac{1}{\gcd (i,k)}\prod _{i=1}^A\prod _{j=1}^B\prod _{k=1}^C\text{lcm}(i,j)$
$(\prod _{i=1}^A\prod _{k=1}^C\frac{1}{\gcd (i,k)}{)}^B(\prod _{i=1}^A\prod _{j=1}^B\text{lcm}(i,j){)}^C$
$(\prod _{i=1}^A\prod _{k=1}^C\frac{1}{\gcd (i,k)}{)}^B(\prod _{i=1}^A\prod _{j=1}^B\frac{ij}{\gcd (i,j)}{)}^C$
$(\prod _{i=1}^A\prod _{k=1}^C\frac{1}{\gcd (i,k)}{)}^B(\prod _{i=1}^A\prod _{j=1}^B\frac{1}{\gcd (i,j)}{)}^C(\prod _{i=1}^A\prod _{j=1}^{B}ij{)}^C$
$(\prod _{i=1}^A\prod _{k=1}^C\frac{1}{\gcd (i,k)}{)}^B(\prod _{i=1}^A\prod _{j=1}^B\frac{1}{\gcd (i,j)}{)}^C((A!{)}^B(B!{)}^A{)}^C$

---

$\prod _{i=1}^A\prod _{j=1}^B\gcd (i,j{)}^{ij}$
$\prod _d{d}^{\sum _{i=1}^A\sum _{j=1}^B[\gcd (i,j)==d](ij)}$
$\prod _d{d}^{\sum _{i=1}^{\lfloor \frac{A}{d}\rfloor }\sum _{j=1}^{\lfloor \frac{B}{d}\rfloor }[\gcd (i,j)==1](idjd)}$
$\prod _d{d}^{d^2{d}^{\prime 2}\sum _{d^{\prime }}\mu (d^{\prime })\sum _{i=1}^{\lfloor \frac{A}{d{d}^{\prime }}\rfloor }\sum _{j=1}^{\lfloor \frac{B}{d{d}^{\prime }}\rfloor }(ij)}$
$\prod _d{d}^{d^2{d}^{\prime 2}\sum _{d^{\prime }}\mu (d^{\prime })\sum _{i=1}^{\lfloor \frac{A}{d{d}^{\prime }}\rfloor }i\sum _{j=1}^{\lfloor \frac{B}{d{d}^{\prime }}\rfloor }j}$
$\prod _D(\prod _{d|D}{d}^{\mu (\lfloor \frac{D}{d}\rfloor )}{)}^{D^2\sum _{i=1}^{\lfloor \frac{A}{D}\rfloor }i\sum _{j=1}^{\lfloor \frac{B}{D}\rfloor }j}$

<—>
$\prod _{i=1}^A\prod _{j=1}^B\prod _{k=1}^C\gcd (i,j{)}^{ijk}$
$\prod _{k=1}^C(\prod _{i=1}^A\prod _{j=1}^B\gcd (i,j{)}^{ij}{)}^k$
$(\prod _{i=1}^A\prod _{j=1}^B\gcd (i,j{)}^{ij}{)}^{\sum _{k=1}^{C}k}$

---

$\prod _{i=1}^A\prod _{j=1}^B\prod _{k=1}^C{i}^{ijk}$
$\prod _{i=1}^A{i}^{i\sum _{j=1}^B\sum _{k=1}^{C}jk}$
$\prod _{i=1}^A{i}^{i(\sum _{j=1}^{B}j)(\sum _{k=1}^{C}k)}$

---

$type=1$
$\prod _{i=1}^A\prod _{j=1}^B\prod _{k=1}^C(\frac{\text{lcm}(i,j)}{\gcd (i,k)}{)}^{ijk}$
$\prod _{i=1}^A\prod _{j=1}^B\prod _{k=1}^C\frac{1}{\gcd (i,k{)}^{ijk}}\prod _{i=1}^A\prod _{j=1}^B\prod _{k=1}^C\text{lcm}(i,j{)}^{ijk}$
$\prod _{i=1}^A\prod _{j=1}^B\prod _{k=1}^C\frac{1}{\gcd (i,k{)}^{ijk}}\prod _{i=1}^A\prod _{j=1}^B\prod _{k=1}^C(\frac{ij}{\gcd (i,j)}{)}^{ijk}$

---

$type=2$

$\prod _{i=1}^A\prod _{j=1}^B\prod _{k=1}^C{i}^{\gcd (i,j,k)}$
$\prod _d\prod _{i=1}^A{i}^{d\sum _{j=1}^B\sum _{k=1}^C[\gcd (i,j,k)==d]}$
$\prod _d\prod _{i=1}^{\lfloor \frac{A}{d}\rfloor }(id{)}^{d\sum _{j=1}^{\lfloor \frac{B}{d}\rfloor }\sum _{k=1}^{\lfloor \frac{C}{d}\rfloor }[\gcd (i,j,k)==1]}$
$\prod _d\prod _{i=1}^{\lfloor \frac{A}{d}\rfloor }(id{)}^{d\sum _{j=1}^{\lfloor \frac{B}{d}\rfloor }\sum _{k=1}^{\lfloor \frac{C}{d}\rfloor }[\gcd (i,j,k)==1]}$
$\prod _d\prod _{d^{\prime }}\prod _{i=1}^{\lfloor \frac{A}{d{d}^{\prime }}\rfloor }(id{d}^{\prime }{)}^{d\mu (d^{\prime })\lfloor \frac{B}{d{d}^{\prime }}\rfloor \lfloor \frac{C}{d{d}^{\prime }}\rfloor }$
$\prod _D(\prod _{d|D}\prod _{i=1}^{\lfloor \frac{A}{D}\rfloor }(iD{)}^{d\mu (\lfloor \frac{D}{d}\rfloor )}{)}^{\lfloor \frac{B}{D}\rfloor \lfloor \frac{C}{D}\rfloor }$
$\prod _D(\prod _{d|D}(\prod _{i=1}^{\lfloor \frac{A}{D}\rfloor }(i{)}^{d\mu (\lfloor \frac{D}{d}\rfloor )})(D^{d\mu (\lfloor \frac{D}{d}\rfloor )\lfloor \frac{A}{D}\rfloor }){)}^{\lfloor \frac{B}{D}\rfloor \lfloor \frac{C}{D}\rfloor }$
$\prod _D{\left(\prod _{d|D}(\lfloor \frac{A}{D}\rfloor ){!}^{d\mu (\lfloor \frac{D}{d}\rfloor )}{D}^{d\mu (\lfloor \frac{D}{d}\rfloor )\lfloor \frac{A}{D}\rfloor }\right)}^{\lfloor \frac{B}{D}\rfloor \lfloor \frac{C}{D}\rfloor }$
$\prod _D{\left(\prod _{d|D}{\left((\lfloor \frac{A}{D}\rfloor )!D^{\lfloor \frac{A}{D}\rfloor }\right)}^{d\mu (\lfloor \frac{D}{d}\rfloor )}\right)}^{\lfloor \frac{B}{D}\rfloor \lfloor \frac{C}{D}\rfloor }$
$\prod _D{\left({\left((\lfloor \frac{A}{D}\rfloor )!D^{\lfloor \frac{A}{D}\rfloor }\right)}^{\sum _{d|D}d\mu (\lfloor \frac{D}{d}\rfloor )}\right)}^{\lfloor \frac{B}{D}\rfloor \lfloor \frac{C}{D}\rfloor }$
$\prod _D{\left({\left((\lfloor \frac{A}{D}\rfloor )!D^{\lfloor \frac{A}{D}\rfloor }\right)}^{\phi (D)}\right)}^{\lfloor \frac{B}{D}\rfloor \lfloor \frac{C}{D}\rfloor }$
$\prod _D{\left((\lfloor \frac{A}{D}\rfloor ){!}^{\phi (D)}{\left(D^{\phi (D)}\right)}^{\lfloor \frac{A}{D}\rfloor }\right)}^{\lfloor \frac{B}{D}\rfloor \lfloor \frac{C}{D}\rfloor }$
${\left(\prod _D(\lfloor \frac{A}{D}\rfloor ){!}^{\phi (D)}\right)}^{\lfloor \frac{B}{D}\rfloor \lfloor \frac{C}{D}\rfloor }{\left(\prod _D\left(D^{\phi (D)}\right)\right)}^{\lfloor \frac{A}{D}\rfloor \lfloor \frac{B}{D}\rfloor \lfloor \frac{C}{D}\rfloor }$
这里右边可以预处理来做。（不过后面我们可以消掉这个部分）

---

$type=2$
$\prod _{i=1}^A\prod _{j=1}^B\prod _{k=1}^C\gcd (i,j{)}^{\gcd (i,j,k)}$
$\prod _d{d}^{(\sum _{k=1}^C\gcd (d,k))(\sum _{i=1}^A\sum _{j=1}^B[\gcd (i,j)==d])}$
$\prod _d{d}^{(\sum _{k=1}^C\gcd (d,k))(\sum _{i=1}^{\lfloor \frac{A}{d}\rfloor }\sum _{j=1}^{\lfloor \frac{B}{d}\rfloor }[\gcd (i,j)==1])}$
$\prod _d{d}^{(\sum _{k=1}^C\gcd (d,k))(\sum _{d^{\prime }}\mu (d^{\prime })\lfloor \frac{A}{d{d}^{\prime }}\rfloor \lfloor \frac{B}{d{d}^{\prime }}\rfloor )}$
$\prod _D{\left(\prod _{d|D}{d}^{\mu (\frac{D}{d})(\sum _{k=1}^C\gcd (d,k))}\right)}^{\lfloor \frac{A}{D}\rfloor \lfloor \frac{B}{D}\rfloor }$
$O(Tn\log n)$ 不太行常数大。

$\prod _{i=1}^A\prod _{j=1}^B\prod _{k=1}^C\gcd (i,j{)}^{\gcd (i,j,k)}$
$\prod _d\prod _{i=1}^A\prod _{j=1}^B\gcd (i,j{)}^{d(\sum _{k=1}^C[\gcd (i,j,k)==d])}$
$\prod _d\prod _{i=1}^{\lfloor \frac{A}{d}\rfloor }\prod _{j=1}^{\lfloor \frac{B}{d}\rfloor }(d\gcd (i,j){)}^{d(\sum _{k=1}^{\lfloor \frac{C}{d}\rfloor }[\gcd (i,j,k)==1])}$
$\prod _d\prod _{i=1}^{\lfloor \frac{A}{d}\rfloor }\prod _{j=1}^{\lfloor \frac{B}{d}\rfloor }(d\gcd (i,j){)}^{d(\sum _{k=1}^{\lfloor \frac{C}{d}\rfloor }[\gcd (i,j,k)==1])}$
$\prod _d\prod _{d^{\prime }}\prod _{i=1}^{\lfloor \frac{A}{d{d}^{\prime }}\rfloor }\prod _{j=1}^{\lfloor \frac{B}{d{d}^{\prime }}\rfloor }(d{d}^{\prime }\gcd (i,j){)}^{d\mu (d^{\prime })\lfloor \frac{C}{d{d}^{\prime }}\rfloor }$
$(\prod _d\prod _{d^{\prime }}\prod _{i=1}^{\lfloor \frac{A}{d{d}^{\prime }}\rfloor }\prod _{j=1}^{\lfloor \frac{B}{d{d}^{\prime }}\rfloor }\gcd (i,j{)}^{d\mu (d^{\prime })\lfloor \frac{C}{d{d}^{\prime }}\rfloor })(\prod _d\prod _{d^{\prime }}d{d}^{\prime d\mu (d^{\prime })\lfloor \frac{A}{d{d}^{\prime }}\rfloor \lfloor \frac{B}{d{d}^{\prime }}\rfloor \lfloor \frac{C}{d{d}^{\prime }}\rfloor })$
$(\prod _d\prod _{d^{\prime }}\prod _{i=1}^{\lfloor \frac{A}{d{d}^{\prime }}\rfloor }\prod _{j=1}^{\lfloor \frac{B}{d{d}^{\prime }}\rfloor }\gcd (i,j{)}^{d\mu (d^{\prime })\lfloor \frac{C}{d{d}^{\prime }}\rfloor })(\prod _D\prod _{d|D}{D}^{d\mu (\lfloor \frac{D}{d}\rfloor )\lfloor \frac{A}{D}\rfloor \lfloor \frac{B}{D}\rfloor \lfloor \frac{C}{D}\rfloor })$
$(\prod _d\prod _{d^{\prime }}\prod _{i=1}^{\lfloor \frac{A}{d{d}^{\prime }}\rfloor }\prod _{j=1}^{\lfloor \frac{B}{d{d}^{\prime }}\rfloor }\gcd (i,j{)}^{d\mu (d^{\prime })\lfloor \frac{C}{d{d}^{\prime }}\rfloor })(\prod _D(D^{\phi (D)}{)}^{\lfloor \frac{A}{D}\rfloor \lfloor \frac{B}{D}\rfloor \lfloor \frac{C}{D}\rfloor })$

这个右边跟上面右边一样，一个是在上面贡献一个是在下面贡献，而且跟谁贡献无关，都是两个贡献，所以可以消掉。

---

$type=2$
${\left(\prod _D(\lfloor \frac{A}{D}\rfloor ){!}^{\phi (D)}\right)}^{\lfloor \frac{B}{D}\rfloor \lfloor \frac{C}{D}\rfloor }$
$\prod _d\prod _{d^{\prime }}\prod _{i=1}^{\lfloor \frac{A}{d{d}^{\prime }}\rfloor }\prod _{j=1}^{\lfloor \frac{B}{d{d}^{\prime }}\rfloor }\gcd (i,j{)}^{d\mu (d^{\prime })\lfloor \frac{C}{d{d}^{\prime }}\rfloor }$
$\prod _D{\left(\prod _{d|D}\prod _{i=1}^{\lfloor \frac{A}{D}\rfloor }\prod _{j=1}^{\lfloor \frac{B}{D}\rfloor }\gcd (i,j{)}^{d\mu (\frac{D}{d})}\right)}^{\lfloor \frac{C}{D}\rfloor }$
$\prod _D{\left(\prod _{i=1}^{\lfloor \frac{A}{D}\rfloor }\prod _{j=1}^{\lfloor \frac{B}{D}\rfloor }\gcd (i,j{)}^{\phi (D)}\right)}^{\lfloor \frac{C}{D}\rfloor }$
$\prod _D{\left(\prod _t{t}^{\left(\sum _{i=1}^{\lfloor \frac{A}{D}\rfloor }\sum _{j=1}^{\lfloor \frac{B}{D}\rfloor }[\gcd (i,j)==t]\right)\phi (D)}\right)}^{\lfloor \frac{C}{D}\rfloor }$
$\prod _D{\left(\prod _t{t}^{\left(\sum _{i=1}^{\lfloor \frac{A}{Dt}\rfloor }\sum _{j=1}^{\lfloor \frac{B}{Dt}\rfloor }[\gcd (i,j)==1]\right)\phi (D)}\right)}^{\lfloor \frac{C}{D}\rfloor }$
$\prod _D{\left(\prod _t{t}^{\left(\sum _{t^{\prime }}\mu (t^{\prime })\lfloor \frac{A}{Dt{t}^{\prime }}\rfloor \lfloor \frac{B}{Dt{t}^{\prime }}\rfloor \right)\phi (D)}\right)}^{\lfloor \frac{C}{D}\rfloor }$
$\prod _D{\left(\prod _t\prod _{t^{\prime }}{t}^{\mu (t^{\prime })\lfloor \frac{A}{Dt{t}^{\prime }}\rfloor \lfloor \frac{B}{Dt{t}^{\prime }}\rfloor \phi (D)}\right)}^{\lfloor \frac{C}{D}\rfloor }$
$\prod _D{\left(\prod _T{\left(\prod _{t|T}{t}^{\mu (\frac{T}{t})}\right)}^{\lfloor \frac{A}{DT}\rfloor \lfloor \frac{B}{DT}\rfloor }\right)}^{\lfloor \frac{C}{D}\rfloor \phi (D)}$
预处理最里面的括号里面的值，然后两次整除分块做。

代码

#include<cstdio>
#include<iostream>
#define ll long long

using namespace std;

const int N = 1e5 + 10;
int T, mo, A, B, C;

ll ksm(ll x, ll y, ll p) {
	ll re = 1;
	while (y) {if (y & 1) re = re * x % p; x = x * x % p; y >>= 1;}
	return re;
}

int prime[N], mu[N]; bool np[N];
ll jc[N], inv[N], ii2[N], F2[N], f2[N], fv2[N], phi[N], fakphi[N], fakphiv[N];
void Init() {
	inv[0] = inv[1] = 1; for (int i = 2; i <= 100000; i++) inv[i] = inv[mo % i] * (mo - mo / i) % mo;
	jc[0] = 1; for (int i = 1; i <= 100000; i++) jc[i] = jc[i - 1] * i % mo;
	ii2[0] = 1; for (int i = 1; i <= 100000; i++) ii2[i] = ii2[i - 1] * ksm(i, i, mo) % mo;
	mu[1] = 1; phi[1] = 1;
	for (int i = 2; i <= 100000; i++) {
		if (!np[i]) mu[i] = -1, prime[++prime[0]] = i, phi[i] = i - 1;
		for (int j = 1; j <= prime[0] && i * prime[j] <= 100000; j++) {
			np[i * prime[j]] = 1;
			if (i % prime[j] == 0) {
				phi[i * prime[j]] = phi[i] * prime[j];
				break;
			}
			mu[i * prime[j]] = -mu[i]; phi[i * prime[j]] = phi[i] * (prime[j] - 1);
		}
		mu[i] += mu[i - 1];
		phi[i] += phi[i - 1];
	}
	
	for (int i = 0; i <= 100000; i++) F2[i] = 1;
	for (int i = 1; i <= 100000; i++) {
		f2[i] = i; fv2[i] = ksm(i, mo - 2, mo);
		for (int j = i; j <= 100000; j += i) {
			if (!(mu[j / i] - mu[j / i - 1])) continue;
			F2[j] = F2[j] * (mu[j / i] - mu[j / i - 1] == 1 ? f2[i] : fv2[i]) % mo;
		}
		F2[i] = ksm(F2[i], 1ll * i * i, mo);
		F2[i] = F2[i - 1] * F2[i] % mo;
	}
	
	for (int i = 0; i <= 100000; i++) fakphi[i] = 1; fakphiv[0] = 1;
	for (int i = 1; i <= 100000; i++) {
		for (int j = i; j <= 100000; j += i) {
			ll now = 1; if (mu[j / i] - mu[j / i - 1]) now = (mu[j / i] - mu[j / i - 1] == 1) ? i : inv[i];
			fakphi[j] = fakphi[j] * now % mo;
		}
		fakphi[i] = fakphi[i - 1] * fakphi[i] % mo;
		fakphiv[i] = ksm(fakphi[i], mo - 2, mo);
	}
}

ll sumgcd1(int n, int m, ll p) {
	ll re = 0;
	for (int L = 1, R; L <= n && L <= m; L = R + 1) {
		R = min(n / (n / L), m / (m / L));
		(re += 1ll * (mu[R] - mu[L - 1] + p) % p * (n / L) % p * (m / L) % p) %= p;
	}
	return re;
}

ll prodgcd1(int n, int m) {
	ll re = 1;
	for (int L = 1, R; L <= n && L <= m; L = R + 1) {
		R = min(n / (n / L), m / (m / L));
		ll di = 1; for (int i = L; i <= R; i++) di = di * i % mo;
		re = re * ksm(di, sumgcd1(n / L, m / L, mo - 1), mo) % mo;
	}
	return re;
}

void work1() {
	ll re = ksm(ksm(prodgcd1(A, C), mo - 2, mo), B, mo);
	(re *= ksm(ksm(jc[A], B, mo) * ksm(jc[B], A, mo) % mo, C, mo)) %= mo;
	(re *= ksm(ksm(prodgcd1(A, B), mo - 2, mo), C, mo)) %= mo;
	printf("%lld ", re);
}

ll sumn(ll x, ll p) {
	return 1ll * x * (x + 1) / 2 % p;
}

ll prodgcd2(ll n, ll m) {
	ll re = 1;
	for (int L = 1, R; L <= n && L <= m; L = R + 1) {
		R = min(n / (n / L), m / (m / L));
		re = re * ksm(F2[R] * ksm(F2[L - 1], mo - 2, mo) % mo, sumn(n / L, mo - 1) * sumn(m / L, mo - 1) % (mo - 1), mo) % mo;
	}
	return re;
}

void work2() {
	ll re = ksm(prodgcd2(A, C), (mo - 2) * sumn(B, mo - 1) % (mo - 1), mo);
	(re *= ksm(ii2[A], sumn(B, mo - 1) * sumn(C, mo - 1) % (mo - 1), mo)) %= mo;
	(re *= ksm(ii2[B], sumn(A, mo - 1) * sumn(C, mo - 1) % (mo - 1), mo)) %= mo;
	(re *= ksm(prodgcd2(A, B), (mo - 2) * sumn(C, mo - 1) % (mo - 1), mo)) %= mo;
	printf("%lld ", re);
}

ll prodi3(ll A, ll B, ll C) {
	ll re = 1;
	for (int L = 1, R; L <= A && L <= B && L <= C; L = R + 1) {
		R = min(A / (A / L), min(B / (B / L), C / (C / L)));
		ll now = ksm(jc[A / L], phi[R] - phi[L - 1], mo);
		re = re * ksm(now, (B / L) * (C / L) % (mo - 1), mo) % mo;
	}
	return re;
}

ll prodgcd3s(ll A, ll B) {
	ll re = 1;
	for (int L = 1, R; L <= A && L <= B; L = R + 1) {
		R = min(A / (A / L), B / (B / L));
		ll sum = fakphi[R] * fakphiv[L - 1] % mo;
		(re *= ksm(sum, (A / L) * (B / L) % (mo - 1), mo)) %= mo;
	}
	return re;
}

ll prodgcd3(ll A, ll B, ll C) {
	ll re = 1;
	for (int L = 1, R; L <= A && L <= B && L <= C; L = R + 1) {
		R = min(A / (A / L), min(B / (B / L), C / (C / L)));
		re = re * ksm(prodgcd3s(A / L, B / L), (C / L) * (phi[R] - phi[L - 1]) % (mo - 1), mo) % mo;
	}
	return re;
}

void work3() {
	ll re = ksm(prodgcd3(A, B, C), mo - 2, mo);
	(re *= prodi3(A, B, C)) %= mo;
	(re *= prodi3(B, A, C)) %= mo;
	(re *= ksm(prodgcd3(A, C, B), mo - 2, mo)) %= mo;
	printf("%lld\n", re);
}

int main() {
	scanf("%d %d", &T, &mo);
	Init();
	while (T--) {
		scanf("%d %d %d", &A, &B, &C);
		
		work1();
		work2();
		work3();
	}
	
	return 0;
}