记录一下 F F T FFT FFT模板
(内存记得开大点(最好四倍))
下次改用手写复数类,
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<stdio.h>
#include<string.h>
#include<queue>
#include<cmath>
#include<map>
#include<set>
#include<vector>
#include<complex>
using namespace std;
#define inf 0x3f3f3f3f
#define lson l,mid,rt<<1
#define rson mid+1,r,rt<<1|1
#define mem(a,b) memset(a,b,sizeof(a));
#define lowbit(x) x&-x;
#define debugint(name,x) printf("%s: %d\n",name,x);
#define debugstring(name,x) printf("%s: %s\n",name,x);
typedef long long ll;
typedef unsigned long long ull;
#define cp complex<double>
const double PI = acos(-1.0);
const double eps = 1e-6;
const int maxn = 4e6+5;
const int mod = 1e9+7;
inline int read()
{
int x=0,f=1;char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
return x*f;
}
int n,m,N; cp omg[maxn],inv[maxn],a[maxn],b[maxn];
void init(){
for(int i = 0; i < N; i++){
omg[i] = cp(cos(2 * PI * i / N), sin(2 * PI * i / N));
inv[i] = conj(omg[i]);
}
}
void fft(cp *a, cp *omg){
int lim = 0;
while((1 << lim) < N) lim++;
for(int i = 0; i < N; i++){
int t = 0;
for(int j = 0; j < lim; j++)
if((i >> j) & 1) t |= (1 << (lim - j - 1));
if(i < t) swap(a[i], a[t]); // i < t 的限制使得每对点只被交换一次(否则交换两次相当于没交换)
}
for(int l = 2; l <= N; l *= 2){
int m = l / 2;
for(cp *p = a; p != a + N; p += l)
for(int i = 0; i < m; i++){
cp t = omg[N / l * i] * p[i + m];
p[i + m] = p[i] - t;
p[i] += t;
}
}
}
int main(){
scanf("%d%d",&n,&m);
int limit = 1;
while(limit <= n+m) limit <<= 1;
N = limit;
for(int i = 0; i <= n; i++){
int x;
scanf("%d",&x);
a[i].real(x); //复数的实部部分
}
for(int i = 0; i <= m; i++){
int x;
scanf("%d",&x);
b[i].real(x);
}
init();
//系数表示法变为点值
fft(a,omg);
fft(b,omg);
for(int i = 0; i <= limit; i++)
a[i] *= b[i];
//点值表示法变为系数
fft(a,inv);
for(int i = 0; i <= n+m; i++) printf("%d ",(int)(a[i].real()/limit+0.5));
}