【多项式】快速傅里叶变换

洛谷 - P1919 【模板】A*B Problem升级版（FFT快速傅里叶）

// FFT
// Luogu P1919 a*b problem
#include <bits/stdc++.h>
using namespace std;
struct Complex {
    double x, y;
    Complex(double _x = 0.0, double _y = 0.0) {
        x = _x;
        y = _y;
    }
    Complex operator+(const Complex &rhs) const {
        return Complex(x + rhs.x, y + rhs.y);
    }
    Complex operator-(const Complex &rhs) const {
        return Complex(x - rhs.x, y - rhs.y);
    }
    Complex operator*(const Complex &rhs) const {
        return Complex(x * rhs.x - y * rhs.y, x * rhs.y + y * rhs.x);
    }
};
const double PI = acos(-1.0);
const int N = 1 << 21;
Complex x1[N], x2[N];
int rev[N];
char str1[N / 2], str2[N / 2];
int sum[N];

void change(Complex y[], int len) {
    for (int i = 0; i < len; ++i) {
        rev[i] = rev[i >> 1] >> 1;
        if (i & 1) {
            rev[i] |= len >> 1;
        }
    }
    for (int i = 0; i < len; ++i) {
        if (i < rev[i]) {
            swap(y[i], y[rev[i]]);
        }
    }
    return ;
}
/*
void change(Complex y[], int len) {
  int i, j, k;
  for (int i = 1, j = len / 2; i < len - 1; i++) {
    if (i < j) swap(y[i], y[j]);
    k = len / 2;
    while (j >= k) {
      j = j - k;
      k = k / 2;
    }
    if (j < k) j += k;
  }
}
*/
void fft(Complex y[], int len, int rev) {
    change(y, len);
    for (int h = 2; h <= len; h <<= 1) {
        Complex wn(cos(2 * PI / h), sin(rev * 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 (rev == -1) {
        for (int i = 0; i < len; ++i) {
            y[i].x /= len;
        }
    }
}

int main() {
    scanf("%s%s", str1, str2);
    int len1 = strlen(str1);
    int len2 = strlen(str2);
    int len = 1;
    while (len < len1 * 2 || len < len2 * 2) {
        len <<= 1;
    }
    for (int i = 0; i < len1; ++i) x1[i] = Complex(str1[len1 - 1 - i]-'0', 0);
    for (int i = len1; i < len; ++i) x1[i] = Complex(0, 0);
    for (int i = 0; i < len2; ++i) x2[i] = Complex(str2[len2 - 1 - i]-'0', 0);
    for (int i = len2; 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 < len; ++i) sum[i] = int(x1[i].x + 0.5);
    for (int i = 0; i < len; ++i) {
        sum[i + 1] += sum[i] / 10;
        sum[i] %= 10;
    }
    len = len1 + len2 - 1;
    while (sum[len] == 0 && len > 0) --len;
    for (int i = len; i >= 0; --i) printf("%c", sum[i] + '0');
    printf("\n");
    return 0;
}