洛谷P7486 「Stoi2031」彩虹(莫比乌斯反演)
题目链接:https://www.luogu.com.cn/problem/P7486
题目大意:给定 l , r ( l ≤ r ) l,r(l\leq r) l,r(l≤r) ,求 ∏ i = l r ∏ j = l r l c m ( i , j ) l c m ( i , j ) m o d 32465177 \prod\limits_{i=l}^r\prod\limits_{j=l}^rlcm(i,j)^{lcm(i,j)} \bmod 32465177 i=l∏rj=l∏rlcm(i,j)lcm(i,j)mod32465177 。
题解:考虑简化问题,有:
原 式 ⇒ ∏ i = l r ∏ j = l r f ( i , j ) = ∏ i = l r ∏ j = 1 r f ( i , j ) ∏ j ′ = 1 l − 1 f ( i , j ′ ) = ∏ i = 1 r ∏ j = 1 r f ( i , j ) ∏ j ′ = 1 l − 1 f ( i , j ′ ) ∏ i ′ = 1 l − 1 ∏ k = 1 l − 1 f ( i ′ , k ) ∏ k = 1 r f ( i ′ , k ′ ) = s o l v e ( r , r ) ∗ s o l v e ( l − 1 , l − 1 ) s o l v e ( r , l − 1 ) ∗ s o l v e ( l − 1 , r ) \begin{aligned} 原式&\Rightarrow\prod\limits_{i=l}^r\prod\limits_{j=l}^rf(i,j) \\&=\prod\limits_{i=l}^r\frac{\prod\limits_{j=1}^rf(i,j)}{\prod\limits_{j'=1}^{l-1}f(i,j')} \\&=\prod\limits_{i=1}^r\frac{\prod\limits_{j=1}^rf(i,j)}{\prod\limits_{j'=1}^{l-1}f(i,j')}\prod\limits_{i'=1}^{l-1}\frac{\prod\limits_{k=1}^{l-1}f(i',k)}{\prod\limits_{k=1}^{r}f(i',k')} \\&=\frac{solve(r,r)*solve(l-1,l-1)}{solve(r,l-1)*solve(l-1,r)} \end{aligned} 原式⇒i=l∏rj=l∏rf(i,j)=i=l∏rj′=1∏l−1f(i,j′)j=1∏rf(i,j)=i=1∏rj′=1∏l−1f(i,j′)j=1∏rf(i,j)i′=1∏l−1k=1∏rf(i′,k′)k=1∏l−1f(i′,k)=solve(r,l−1)∗solve(l−1,r)solve(r,r)∗solve(l−1,l−1)
这里的 s o l v e ( n , m ) = ∏ i = 1 n ∏ j = 1 m l c m ( i , j ) l c m ( i , j ) solve(n,m)=\prod\limits_{i=1}^n\prod\limits_{j=1}^mlcm(i,j)^{lcm(i,j)} solve(n,m)=i=1∏nj=1∏mlcm(i,j)lcm(i,j) 。那么我们考虑求出 s o l v e ( n , m ) solve(n,m) solve(n,m) 的值即可。下作 s o l v e ( n , m ) solve(n,m) solve(n,m) 的化简。