FFT模板

题目链接：【模板】多项式乘法（FFT）

学习博客：FFT学习笔记

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<cmath>
#include<algorithm>
#include<queue>
#include<stack>
#include<vector>
#include<map>
#include<set>
#define inf 0x3f3f3f3f
using namespace std;

typedef long long ll;

const int N = 4000010;
const double pi = acos(-1.0);

struct Complex
{
    double x, y;
    Complex(double _x = 0.0, double _y = 0.0)
    {
        x = _x;
        y = _y;
    }
    Complex operator - (const Complex &b) const
    {
        return Complex(x - b.x, y - b.y);
    }
    Complex operator + (const Complex &b) const
    {
        return Complex(x + b.x, y + b.y);
    }
    Complex operator * (const Complex &b) const
    {
        return Complex(x * b.x - y * b.y, x * b.y + y * b.x);
    }
};

void change(Complex y[], int len)
{
    int i, j, k;
    for(i = 1, j = len / 2; i < len - 1; i++)
    {
        if(i < j)
        {
            swap(y[i], y[j]);
        }
        k = len / 2;
        while(j >= k)
        {
            j -= k;
            k /= 2;
        }
        if(j < k)
        {
            j += k;
        }
    }
    return ;
}

void fft(Complex y[], int len, int on)
{
    change(y, len);
    for(int h = 2; h <= len; h <<= 1)
    {
        Complex wn(cos(-on * 2 * pi / h), sin(-on * 2 * pi / h));
        for(int j = 0; j < len; j += h)
        {
            Complex w(1, 0);
            for(int k = j; k < j + h / 2; k++)
            {
                Complex u = y[k];
                Complex t = w * y[k + h / 2];
                y[k] = u + t;
                y[k + h / 2] = u - t;
                w = w * wn;
            }
        }
    }
    if(on == -1)
    {
        for(int i = 0; i < len; i++)
        {
            y[i].x /= len;
        }
    }
}

int n, m;
int a[N / 2], b[N / 2];
Complex x1[N], x2[N];

int main()
{
    scanf("%d %d", &n, &m);
    n++;
    m++;
    for(int i = 0; i < n; i++)
    {
        scanf("%d", &a[i]);
    }
    for(int i = 0; i < m; i++)
    {
        scanf("%d", &b[i]);
    }
    int len = 1;
    while(len < n * 2 || len < m * 2) len *= 2;
    for(int i = 0; i < n; i++)
    {
        x1[i] = Complex(a[i], 0);
    }
    for(int i = n; i < len; i++)
    {
        x1[i] = Complex(0, 0);
    }
    for(int i = 0; i < m; i++)
    {
        x2[i] = Complex(b[i], 0);
    }
    for(int i = m; i < len; i++)
    {
        x2[i] = Complex(0, 0);
    }
    fft(x1, len, 1);
    fft(x2, len, 1);
    for(int i = 0; i < len; i++) x1[i] = x1[i] * x2[i];
    fft(x1, len, -1);
    for(int i = 0; i < n + m - 1; i++)
    {
        if(i != len - 1) printf("%d ", (int)(x1[i].x + 0.5));
        else printf("%d\n", (int)(x1[i].x + 0.5));
    }
    return 0;
}