fft

资料
http://blog.miskcoo.com/2015/04/polynomial-multiplication-and-fast-fourier-transform
https://blog.csdn.net/iamzky/article/details/22712347
两道板子题
【模板】A*B Problem升级版（FFT快速傅里叶）

#include<cstdio>
#include<cmath>
#include<iostream>
const double PI=acos(-1);
const int N=2*610000;
using namespace std;
struct complex{
    double x,y;
    complex(){}
    complex(double xx,double yx) {x=xx,y=yx;} 
    complex operator *(complex &a)const{
        return complex(x*a.x-y*a.y,x*a.y+y*a.x);
    }
    complex operator +(complex &a)const{
        return complex(x+a.x,y+a.y);
    }
    complex operator -(complex &a)const{
        return complex(x-a.x,y-a.y);
    }
}a[N],b[N];
int n,m,c[N],R[N];
void fft(complex *a,int f){
    for(int i=0,j=0;i<n;i++){
        if(i<R[i]) swap(a[i],a[R[i]]);
        //for(int l=n>>1;(j^=1)<l;l>>=1);
    }
    for(int i=1;i<n;i<<=1) {complex w(cos(PI/i),f*sin(PI/i));
        for(int j=0;j<n;j+=(i<<1)){complex e(1,0);
            for(int k=0;k<i;k++,e=e*w){ 
            complex x=a[j+k],y=e*a[j+k+i];a[j+k]=x+y,a[j+k+i]=x-y;
            }   
        }
    }
    if(f==-1) for(int i=0;i<n;i++) a[i].x/=n;
}
char x[N],y[N];
int main(){
    scanf("%d%s%s",&n,x,y);n--;
    for(int i=0;i<=n;i++) a[i].x=x[n-i]-'0',b[i].x=y[n-i]-'0';
    m=n*2;int L=0; 
    for(n=1;n<=m;n<<=1)L++;
    for(int i=0;i<n;i++) R[i]=(R[i>>1]>>1)|((i&1)<<(L-1));
    fft(a,1),fft(b,1);
    for(int i=0;i<=n;i++) a[i]=a[i]*b[i]; 
    fft(a,-1);
    for(int i=0;i<=m;i++) c[i]=(int)(a[i].x+0.1); 
    for(int i=0;i<=m;i++){

        if(c[i]>=10){
            c[i+1]+=c[i]/10;c[i]%=10;
            if(i==m) m++;
        }
    }
    while(m) if(c[m]) break; else m--;
    while(~m) printf("%d",c[m--]);
    return 0; 

} 

P3803 【模板】多项式乘法（FFT）

#include<cstdio>
#include<cmath>
#include<iostream>
const double PI=acos(-1);
const int N=2201000;
using namespace std;
struct complex{
    double x,y;
    complex(){}
    complex(double xx,double yx) {x=xx,y=yx;} 
    complex operator *(complex &a)const{
        return complex(x*a.x-y*a.y,x*a.y+y*a.x);
    }
    complex operator +(complex &a)const{
        return complex(x+a.x,y+a.y);
    }
    complex operator -(complex &a)const{
        return complex(x-a.x,y-a.y);
    }
}a[N],b[N];
int n,m,c[N],R[N];
void fft(complex *a,int f){
    for(int i=0,j=0;i<n;i++){
        if(i<R[i]) swap(a[i],a[R[i]]);
        //for(int l=n>>1;(j^=1)<l;l>>=1);
    }
    for(int i=1;i<n;i<<=1) {complex w(cos(PI/i),f*sin(PI/i));
        for(int j=0;j<n;j+=(i<<1)){complex e(1,0);
            for(int k=0;k<i;k++,e=e*w){ 
            complex x=a[j+k],y=e*a[j+k+i];a[j+k]=x+y,a[j+k+i]=x-y;
            }   
        }
    }
    if(f==-1) for(int i=0;i<n;i++) a[i].x/=n;
}
char x[N],y[N];
int main(){
    scanf("%d%d",&n,&m);
    for(int i=0;i<=n;i++) scanf("%lf",&a[n-i].x);
    for(int j=0;j<=m;j++) scanf("%lf",&b[m-j].x);
    m=n+m+1;int L=0; 
    for(n=1;n<=m;n<<=1)L++;
    for(int i=0;i<n;i++) R[i]=(R[i>>1]>>1)|((i&1)<<(L-1));
    fft(a,1),fft(b,1);
    for(int i=0;i<=n;i++) a[i]=a[i]*b[i]; 
    fft(a,-1);
    for(int i=0;i<=m;i++) c[i]=(int)(a[i].x+0.1); 
    while(m) if(c[m]) break; else m--;
    while(~m) printf("%d ",c[m--]);
    return 0; 

}