bzoj4816 Sdoi2017 数字表格

题面：bzoj4816

题意：求${\prod }_{i=1}^n{\prod }_{j=1}^{m}f[gcd(i,j)]$，其中$f[i]$表示第$i$项斐波那契数列。膜$10^9+7$

题解：

$\begin{array}{rl}ans& =\prod _{i=1}^n\prod _{j=1}^{m}f[gcd(i,j)]\\ & =\prod _{d=1}^n\prod _{i=1}^n\prod _{j=1}^m[gcd(i,j)=d]f[d]\\ & =\prod _{d=1}^{n}f[d{]}^{{\sum }_{i=1}^{\frac{n}{d}}{\sum }_{j=1}^{\frac{m}{d}}[gcd(i,j)=1]}\end{array}$

指数上的那部分：${\sum }_{i=1}^{\frac{n}{d}}{\sum }_{j=1}^{\frac{m}{d}}[gcd(i,j)=1]={\sum }_{i=1}^{\frac{n}{d}}\mu (i)\lfloor \frac{n}{id}\rfloor \lfloor \frac{m}{id}\rfloor$

令$T=id$

${\sum }_{T=1}^n\lfloor \frac{n}{T}\rfloor \lfloor \frac{m}{T}\rfloor {\sum }_{d\mid T}\mu (\frac{T}{d})$

代回得：

$\begin{array}{rl}ans& =\prod _{T=1}^n\prod _{d\mid T}f[d{]}^{\lfloor \frac{n}{T}\rfloor \lfloor \frac{m}{T}\rfloor \mu (\frac{T}{d})}\\ & =\prod _{T=1}^n(\prod _{d\mid T}f[d{]}^{\mu (\frac{T}{d})}{)}^{\lfloor \frac{n}{T}\rfloor \lfloor \frac{m}{T}\rfloor }\end{array}$

整体数论分块，对${\prod }_{d\mid T}f[d{]}^{\mu (\frac{T}{d})}$预处理：每个数计算它对它的倍数的贡献。

预处理复杂度：${\sum }_{i=1}^n\frac{n}{i}\approx nlogn$

同时预处理斐波那契数列的逆元；求$\lfloor \frac{n}{T}\rfloor \lfloor \frac{m}{T}\rfloor$次方时膜$10^9+6$

#include <bits/stdc++.h>
using namespace std;
typedef long long ll ;
const int maxn = 1e6 + 10, mod = 1e9 + 7 ;
int mu[maxn], prime[maxn], tot ;
ll f[maxn], g[maxn], F[maxn] ;
bool vis[maxn] ;
ll power (ll x, int y) {
    ll res = 1 ;
    while (y) {
        if (y & 1) res = res * x % mod ;
        x = x * x % mod; y >>= 1 ;
    }
    return res ;
}
void init () {
    mu[1] = 1; f[1] = g[1] = F[0] = F[1] = 1 ;
    for (int i = 2; i < maxn; i ++) {
        f[i] = (f[i - 1] + f[i - 2]) % mod ;
        g[i] = power (f[i], mod - 2); F[i] = 1 ;
        if (!vis[i]) prime[++ tot] = i, mu[i] = -1 ;
        for (int j = 1; j <= tot && i * prime[j] < maxn; j ++) {
            vis[i * prime[j]] = 1 ;
            if (i % prime[j] == 0) {
                mu[i * prime[j]] = 0; break ;
            }
            mu[i * prime[j]] = -mu[i] ;
        }
    }
    for (int i = 1; i < maxn; i ++) {
        if (!mu[i]) continue ;
        for (int j = i; j < maxn; j += i)
            F[j] = F[j] * (mu[i] == 1 ? f[j / i] : g[j / i]) % mod ;
    }
    for (int i = 2; i < maxn; i ++) F[i] = F[i] * F[i - 1] % mod ;
}
int main() {
    init () ;
    int T ;
    cin >> T ;
    while (T --) {
        int n, m ;
        scanf("%d%d", &n, &m) ;
        if (n > m) swap (n, m) ;
        ll ans = 1 ;
        for (int i = 1, nxt = 0; i <= n; i = nxt + 1) {
            nxt = min (n / (n / i), m / (m / i)) ;
            ll t = F[nxt] * power (F[i - 1], mod - 2) % mod ;
            ans = ans * power (t, 1ll * (n / i) * (m / i) % (mod - 1)) % mod ;
        }
        printf("%lld\n", ans) ;
    }
    return 0 ;
}