#include<bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f;
const int maxl = 300000 + 10;
const double PI = acos(-1.0);
int base, c[maxl];
complex<double> a[maxl], b[maxl], p[maxl];
int read() {
int x =
Radix-2 Recursive-FFT
最新推荐文章于 2024-04-06 18:42:36 发布