快速数论变换（NTT）板子

最新推荐文章于 2021-10-13 20:04:58 发布

Hany01

最新推荐文章于 2021-10-13 20:04:58 发布

阅读量458

点赞数 1

分类专栏：模板 FFT

本文链接：https://blog.csdn.net/hhaannyyii/article/details/79357254

版权

模板同时被 2 个专栏收录

31 篇文章 0 订阅

订阅专栏

FFT

19 篇文章 0 订阅

订阅专栏

$\color{white}{原理讲解？反正我这么菜当然只能背板子了。。}$

/************************************************
 * Au: Hany01
 * Date: Feb 23th, 2018
 * Prob: [UOJ34] NTT Template
 * Email: hany01@foxmail.com
************************************************/

#include<bits/stdc++.h>

using namespace std;

typedef long long LL;
typedef pair<int, int> PII;
#define rep(i, j) for (register int i = 0, i##_end_ = (j); i < i##_end_; ++ i)
#define For(i, j, k) for (register int i = (j), i##_end_ = (k); i <= i##_end_; ++ i)
#define Fordown(i, j, k) for (register int i = (j), i##_end_ = (k); i >= i##_end_; -- i)
#define Set(a, b) memset(a, b, sizeof(a))
#define Cpy(a, b) memcpy(a, b, sizeof(a))
#define fir first
#define sec second
#define pb(a) push_back(a)
#define mp(a, b) make_pair(a, b)
#define ALL(a) (a).begin(), (a).end()
#define SZ(a) ((int)(a).size())
#define INF (0x3f3f3f3f)
#define INF1 (2139062143)
#define Mod (998244353)
#define g (3)
#define debug(...) fprintf(stderr, __VA_ARGS__)
#define y1 wozenmezhemecaia

template <typename T> inline bool chkmax(T &a, T b) { return a < b ? a = b, 1 : 0; }
template <typename T> inline bool chkmin(T &a, T b) { return b < a ? a = b, 1 : 0; }

inline int read()
{
    register int _, __; register char c_;
    for (_ = 0, __ = 1, c_ = getchar(); c_ < '0' || c_ > '9'; c_ = getchar()) if (c_ == '-') __ = -1;
    for ( ; c_ >= '0' && c_ <= '9'; c_ = getchar()) _ = (_ << 1) + (_ << 3) + (c_ ^ 48);
    return _ * __;
}

inline void File()
{
#ifdef hany01
    freopen("ntt.in", "r", stdin);
    freopen("ntt.out", "w", stdout);
#endif
}

const int maxn = 1 << 19;

int n1, n2, cnt, n, m, rev[maxn];
LL powg[maxn], invg[maxn], a[maxn], b[maxn];

inline LL Pow(LL a, LL b) {
    LL Ans = 1;
    for ( ; b; b >>= 1, a = a * a % Mod) if (b & 1) (Ans *= a) %= Mod;
    return Ans;
}

inline void Init()
{
    register int inv = Pow(g, Mod - 2);
    for (register int i = 1; i <= n; i <<= 1)
        powg[i] = Pow(3, (Mod - 1) / i), invg[i] = Pow(inv, (Mod - 1) / i);
}

inline void NTT(LL *a, bool type)
{
    rep(i, n) if (i < rev[i]) swap(a[i], a[rev[i]]);
    for (register int i = 2; i <= n; i <<= 1) {
        register LL wn = type ? powg[i] : invg[i];
        for (register int j = 0; j < n; j += i) {
            register LL w = 1;
            rep(k, (i >> 1)) {
                register LL u = a[j + k], v = a[j + k + (i >> 1)] * w % Mod;
                a[j + k] = (u + v) % Mod, a[j + k + (i >> 1)] = (u - v + Mod) % Mod;
                (w *= wn) %= Mod;
            }
        }
    }
    if (!type) {
        LL invn = Pow(n, Mod - 2);
        rep(i, n) (a[i] *= invn) %= Mod;
    }
}

int main()
{
    File();
    n1 = read() + 1, n2 = read() + 1;
    rep(i, n1) a[i] = read();
    rep(i, n2) b[i] = read();
    m = n1 + n2 - 1;
    for (n = 1; n <= m; n <<= 1) ++ cnt;
    Init();
    rep(i, n) rev[i] = (rev[i >> 1] >> 1) | ((i & 1) << (cnt - 1));
    NTT(a, 1), NTT(b, 1);
    rep(i, n) (a[i] *= b[i]) %= Mod;
    NTT(a, 0);
    rep(i, m) printf("%lld ", a[i]);
    return 0;
}
//斜倚画阑娇不语，暗移梅影过红桥，裙带北风飘。
//    -- 纳兰性德《望江南·咏弦月》