[BZOJ2179]FFT快速傅立叶（FFT）

题目：

我是超链接

题解：

一个 很弱智的高精乘 FFT板子，用fft做完之后要处理进位。

代码：

#include <iostream>
#include <cstdio>
#include <cmath>
using namespace std;
const double pi=acos(-1.0);
const int N=180005;
struct complex
{
    double x,y;
    complex (double X=0,double Y=0){x=X;y=Y;}
}a[N],b[N];int n,r[N],fn,ans[N];char sa[N],sb[N];
complex operator +(complex a,complex b){return complex(a.x+b.x,a.y+b.y);}
complex operator -(complex a,complex b){return complex(a.x-b.x,a.y-b.y);}
complex operator *(complex a,complex b){return complex(a.x*b.x-a.y*b.y,a.x*b.y+a.y*b.x);}
void FFT(complex *a,int id)
{
    for (int i=0;i<n;i++)
      if (i<r[i]) swap(a[i],a[r[i]]);
    for (int k=1;k<n;k<<=1)
    {
        complex wn=complex(cos(pi/k),id*sin(pi/k));
        for (int i=0;i<n;i+=(k<<1))
        {
            complex w=complex(1,0);
            for (int j=0;j<k;j++,w=w*wn)
            {
                complex x=a[i+j],y=w*a[i+j+k];
                a[i+j]=x+y; a[i+j+k]=x-y;
            }
        }
    }
}
int main()
{
    scanf("%d",&fn);scanf("%s",sa);scanf("%s",sb);
    for (int i=0;i<fn;i++) a[i].x=sa[fn-i-1]-'0';
    for (int i=0;i<fn;i++) b[i].x=sb[fn-i-1]-'0';
    fn*=2;int L=0;
    for (n=1;n<=fn;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<=fn;i++) ans[i]=(int)(a[i].x/n+0.5);
    for (int i=0;i<=fn;i++)
    {
        ans[i+1]+=ans[i]/10;
        ans[i]%=10;
    }
    while (!ans[fn] && fn>0) fn--;
    for (int i=fn;i>=0;i--) printf("%d",ans[i]);
}