多项式求逆

对于$f$，若有$g$，使得$f\times g(x) = 1$，称$g$为$f$的逆

给$f$，求$g$的前$n$项，即求$\frac{1}{f(x)}$的麦克劳林级数的前$n$项系数

例：$f(x) = 1 - x$

$g(x) = \frac{1}{1 - x} = \sum_{i = 0}^{\infty} x^i$

$f(x)$存在逆$\Leftrightarrow$常数项非0（否则就要出现$\frac{c}{0}$的情况）

考虑倍增，设$g_t$的前$2^t$位与$g$相同，其余位为$0$，显然有$(f\times g)(x) \equiv 0 \pmod {2^{t+1}}$

显然$g_{(t+1)}(x) - g_t(x)$的前$2^t$项为$0$，则$(g_{t+1}(x) - g_t(x))^2$的前$2^{t+1}$项为$0$，可得

$(g_{t+1}^2-2g_{t+1}g_{t}+g_t^2)(x)\equiv 0 \pmod {2^{t+1}}$

左乘$f(x)$，由$(f\times g_{t+1})(x)\equiv 1 \pmod {2^{t+1}}$

得到$(g_{t+1}-2g_t+f\times g_t^2)(x) \equiv 0 \pmod {2^{t+1}}$

$$g_{t+1} = 2g_t - f \times g_t^2$$

$$g_0 = a_0^{-1}$$

$T(n) = T(\frac{n}{2}) + O(n \log n = O(n \log^2 n)$

代码如下：

#include <bits/stdc++.h>
using namespace std;
const int mod = 998244353 , G = 3 , N = 270000;
int rev[N];
int a[N] , b[N] , c[N];
int read() {
    int ans = 0 , flag = 1;
    char ch = getchar();
    while(ch > '9' || ch < '0') { ch = getchar();if(ch=='-') flag = -1;}
    while(ch <= '9' && ch >= '0') {ans = ans * 10 + ch - '0'; ch = getchar();}
    return ans * flag;
}
int qpow(int a , int b) {
    int ans = 1;
    while(b) {
        if(b & 1) ans = 1ll * ans * a % mod;
        a = 1ll * a * a % mod;
        b >>= 1;
    }
    return ans;
}
void dft(int *now , int n , int f) {
    for(int i = 0 ; i < n ; ++ i) if(i < rev[i]) swap(now[i] , now[rev[i]]);
    for(int i = 1 ; i < n ; i <<= 1) {
        int gn = qpow(G , (mod - 1) / (i<<1));//\frac{P-1}{n}
        if(f != 1) gn = qpow(gn , mod - 2);
        for(int j = 0 ; j < n ; j += (i<<1)) {
            int x , y , g = 1;
            for(int k = 0 ; k < i ; ++ k , g = 1ll * g * gn % mod) {
                x = now[j + k];
                y = 1ll * g * now[i + j + k] % mod;
                now[j + k] = (x + y) % mod;
                now[i + j + k] = ((x - y) % mod + mod ) % mod;
            }
        }
    }
    if(f != 1) {
        int nn = qpow(n , mod - 2);
        for(int i = 0 ; i < n ; ++ i)
            now[i] = 1ll * now[i] * nn % mod;
    }
}
void work(int deg , int *a , int *b) {
    if(deg == 1) {b[0] = qpow(a[0] , mod - 2); return;}
    work((deg + 1) >> 1 , a , b);
    int l = 0 , nn  , n = deg * 2;
    for(nn = 1 ; nn < n ; nn <<= 1) ++ l;
    for(int i = 0 ; i < nn ; ++ i)
        rev[i] = (rev[i>>1]>>1) | ((i & 1) << (l - 1));
    for(int i = 0 ; i < deg ; ++ i) c[i] = a[i];
    for(int i = deg ; i < nn ; ++ i) c[i] = 0;
    dft(c , nn , 1); dft(b , nn , 1);
    for(int i = 0 ; i < nn ; ++ i) b[i] = 1ll * (2 - 1ll * c[i] * b[i] % mod + mod ) % mod * b[i] % mod;
    dft(b , nn , -1);
    for(int i = deg ; i < nn ; ++ i) b[i] = 0;
}
int main() {
    int n = read();
    for(int i = 0 ; i < n ; ++ i) a[i] = read();
    work(n , a , b);
    for(int i = 0 ; i < n ; ++ i) printf("%d ", b[i]);
    return 0;
}