推荐这篇博客:http://www.cnblogs.com/zwfymqz/p/8244902.html
代码(只是留个存档):
#include<bits/stdc++.h>
using namespace std;
const double pai=acos(-1.0);
struct comp
{
double x,y;
comp(double xx=0,double yy=0):x(xx),y(yy) {}
friend comp operator+(const comp &x,const comp &y) {return comp(x.x+y.x,x.y+y.y);}
friend comp operator-(const comp &x,const comp &y) {return comp(x.x-y.x,x.y-y.y);}
friend comp operator*(const comp &a,const comp &b) {return comp(a.x*b.x-a.y*b.y,a.x*b.y+b.x*a.y);}
}a[2500000],b[2500000];
int limit=1,n,m,l=0,r[2500000];
void FFT(comp *now,int ty)
{
for(int i=0;i<limit;i++)
if(i<r[i]) swap(now[i],now[r[i]]);
for(int mid=1;mid<limit;mid<<=1)
{
comp wn(cos(pai/mid),ty*sin(pai/mid));
for(int j=0,R=(mid<<1);j<limit;j+=R)
{
comp w(1,0);
for(int k=0;k<mid;k++,w=w*wn)
{
comp x=now[j+k],y=w*now[j+k+mid];
now[j+k]=x+y;
now[j+k+mid]=x-y;
}
}
}
}
int main()
{
scanf("%d %d",&n,&m);
while(limit<=n+m)
limit<<=1,l++;
for(int i=1;i<=limit;i++)
r[i]=((r[i>>1]>>1)|((i&1)<<(l-1)));
for(int i=0;i<=n;i++)
scanf("%lf",&a[i].x);
for(int i=0;i<=m;i++)
scanf("%lf",&b[i].x);
FFT(a,1);
FFT(b,1);
for(int i=0;i<=limit;i++)
a[i]=a[i]*b[i];
FFT(a,-1);
for(int i=0;i<=n+m;i++)
printf("%d ",(int)(a[i].x/limit+0.5));
}