bzoj2179: FFT快速傅立叶

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
using namespace std;
const double PI=acos(-1);
const int maxn=250005;
int n,len,m,rev[maxn],ans[maxn];
struct node{
    double real,imag;
    node operator +(const node &x){return (node){real+x.real,imag+x.imag};}
    node operator -(const node &x){return (node){real-x.real,imag-x.imag};}
    node operator *(const node &x){return (node){real*x.real-imag*x.imag,real*x.imag+imag*x.real};}
}a[maxn],b[maxn],c[maxn],w,wn,t1,t2;
void read(int &x){
    x=0; int f=1; char ch;
    for (ch=getchar();!isdigit(ch);ch=getchar()) if (ch=='-') f=-1;
    for (;isdigit(ch);ch=getchar()) x=x*10+ch-'0'; x*=f;
}
void Read(node *a){
    char ch;
    for (int i=m-1;i>=0;i--){
        for (ch=getchar();!isdigit(ch);ch=getchar());
        a[i].real=(double)(ch-'0'); 
    }
}
int Rev(int x){
    int temp=0;
    for (int i=0;i<len;i++) temp<<=1,temp+=(x&1),x>>=1;
    return temp;
}
void FFT(node *a,int op){
    for (int i=0;i<n;i++) if (i<rev[i]) swap(a[i],a[rev[i]]);
    for (int s=2;s<=n;s<<=1){
        wn=(node){cos(op*2*PI/s),sin(op*2*PI/s)};
        for (int i=0;i<n;i+=s){
            w=(node){1,0};
            for (int j=i;j<i+s/2;j++,w=w*wn){
                t1=a[j],t2=w*a[j+s/2];
                a[j]=t1+t2,a[j+s/2]=t1-t2;
            }
        }
    }
}
int main(){
    read(m); n=1,len=0;
    while (n<(m<<1)) n<<=1,len++;
    Read(a),Read(b);
    for (int i=0;i<n;i++) rev[i]=Rev(i);
    FFT(a,1),FFT(b,1);
    for (int i=0;i<n;i++) c[i]=a[i]*b[i];
    FFT(c,-1);
    for (int i=0;i<n;i++) ans[i]=(int)round(c[i].real/n);
    for (int i=0;i<n;i++) ans[i+1]+=ans[i]/10,ans[i]=ans[i]%10;
    int j; for (j=n-1;j>=0;j--) if (ans[j]) break;
    if (j==-1) puts("0");
    else{for (;j>=0;j--) printf("%d",ans[j]);puts("");}
    return 0;
}

题目链接：http://www.lydsy.com/JudgeOnline/problem.php?id=2179

题目大意：给定两个大数a，b，求a*b，位数n<=60000;

做法：FFT入门题，FFT的做法可以自己去看算法导论，这题是裸的卷积，直接上DFT或者NTT，我贴的是DFT的。