快速傅里叶变换（FFT）

卷积
给定向量：$a=(a_0,a_1,...,a_{n-1})$，$b=(b_0,b_1,...,b_{n-1})$；
向量和：$a+b=(a_0+b_0,a_1+b_1,...,a_{n-1}+b_{n-1})$
数量积（内积、点积）：$a\cdot b=a_0{b}_0+a_1{b}_1+...+a_{n-1}{b}_{n-1}$
卷积：$a\otimes b=(c_0,c_1,...,c_{2n-2})$，其中$c_k={\sum }_{i+j=k}(a_i{b}_j)$
卷积的最典型的应用就是多项式乘法（多项式乘法就是求卷积）。

$a\otimes b=IDF{T}_{2n}(DF{T}_{2n}(a)\cdot DF{T}_{2n}(b))$，即：$a\otimes b=DF{T}_{2n}^{-1}(DF{T}_{2n}(a)\cdot DF{T}_{2n}(b))$

#include 

#define fp(i, a, b) for (int i = (a), i##_ = (b) + 1; i < i##_; ++i)
using namespace std;
using ll = int64_t;
using db = double;
/*---------------------------------------------------------------------------*/
struct cp
{
    db x, y;
    cp(db real = 0, db imag = 0) : x(real), y(imag){};
    cp operator+(cp b) const
    {
        return {x + b.x, y + b.y};
    }
    cp operator-(cp b) const
    {
        return {x - b.x, y - b.y};
    }
    cp operator*(cp b) const
    {
        return {x * b.x - y * b.y, x * b.y + y * b.x};
    }
};
using vcp = vector;
using Poly = vector;
namespace FFT
{
const db pi = acos(-1);
vcp Omega(int L)
{
    vcp w(L);
    w[1] = 1;
    for (int i = 2; i < L; i <<= 1)
    {
        auto w0 = w.begin() + i / 2, w1 = w.begin() + i;
        cp wn(cos(pi / i), sin(pi / i));
        for (int j = 0; j < i; j += 2)
            w1[j] = w0[j >> 1], w1[j + 1] = w1[j] * wn;
    }
    return w;
}
auto W = Omega(1 << 21); // NOLINT
void DIF(cp *a, int n)
{
    cp x, y;
    for (int k = n >> 1; k; k >>= 1)
        for (int i = 0; i < n; i += k << 1)
            for (int j = 0; j < k; ++j)
                x = a[i + j], y = a[i + j + k], a[i + j + k] = (a[i + j] - y) * W[k + j], a[i + j] = x + y;
}
void IDIT(cp *a, int n)
{
    cp x, y;
    for (int k = 1; k < n; k <<= 1)
        for (int i = 0; i < n; i += k << 1)
            for (int j = 0; j < k; ++j)
                x = a[i + j], y = a[i + j + k] * W[k + j], a[i + j + k] = x - y, a[i + j] = x + y;
    const db Inv = 1. / n;
    fp(i, 0, n - 1) a[i].x *= Inv, a[i].y *= Inv;
    reverse(a + 1, a + n);
}
} // namespace FFT

namespace Polynomial
{
// basic operator
void DFT(vcp &a)
{
    FFT::DIF(a.data(), a.size());
}
void IDFT(vcp &a)
{
    FFT::IDIT(a.data(), a.size());
}
int norm(int n)
{
    return 1 << (__lg(n - 1) + 1);
}

// Poly mul
vcp &dot(vcp &a, vcp &b)
{
    fp(i, 0, a.size() - 1) a[i] = a[i] * b[i];
    return a;
}
Poly operator+(Poly a, Poly b)
{
    int maxlen = max(a.size(), b.size());
    Poly ans(maxlen + 1);
    a.resize(maxlen + 1), b.resize(maxlen + 1);
    for (int i = 0; i < maxlen; i++)
        ans[i] = a[i] + b[i];
    return ans;
}
Poly operator*(ll k, Poly a)
{
    Poly ans;
    for (auto i : a)
        ans.push_back(k * i);
    return ans;
}
Poly operator*(Poly a, Poly b)
{
    int n = a.size() + b.size() - 1;
    vcp c(norm(n));
    fp(i, 0, a.size() - 1) c[i].x = a[i];
    fp(i, 0, b.size() - 1) c[i].y = b[i];
    DFT(c), dot(c, c), IDFT(c), a.resize(n);
    fp(i, 0, n - 1) a[i] = int(c[i].y * .5 + .5);
    return a;
}
} // namespace Polynomial
/*---------------------------------------------------------------------------*/
using namespace Polynomial;
const int N = 5e4 + 10;
int main()
{
    ios::sync_with_stdio(0), cin.tie(0);
    int n, m;
    cin >> n >> m;
    Poly a(n + 1), b(m + 1), c(n + m + 1);
    for (int i = 0; i <= n; i++)
        cin >> a[i];
    for (int i = 0; i <= m; i++)
        cin >> b[i];
    c = a * b;
    for (int i = 0; i <= n + m; i++)
        cout << c[i] << " ";
    return 0;
}
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131