HDU-1402 FFT

Problem Description
Calculate A * B.

Input
Each line will contain two integers A and B. Process to end of file.
Note: the length of each integer will not exceed 50000.

Output
For each case, output A * B in one line.

Sample Input
1
2
1000
2

Sample Output
2
2000
解题思路：
FFT tql
板子：

#include<iostream>
#include<algorithm>
#include<stdio.h>
#include<math.h>
#include<string.h>
using namespace std;
const int maxn=2e5+7;
const double pi=acos(-1);
struct cp{
	double r,i;
	cp(double r=0,double i=0):r(r),i(i){};
	cp operator+(const cp &rhs){
		return cp(r+rhs.r,i+rhs.i);
	}
	cp operator-(const cp &rhs){
		return cp(r-rhs.r,i-rhs.i);
	}
	cp operator*(const cp &rhs){
		return cp(r*rhs.r-i*rhs.i,i*rhs.r+r*rhs.i);
	}
}va[maxn],vb[maxn];
void change(cp F[],int len){
	int j=len>>1;
	for(int i=1;i<len-1;++i){
		if(i<j)swap(F[i],F[j]);
		int k=len>>1;
		while(j>=k)j-=k,k>>=1;
		if(j<k)j+=k;
	}
}
void FFT(cp F[],int len,int op){
	change(F,len);
	for(int h=2;h<=len;h<<=1){
		cp wn(cos(-op*2*pi/h),sin(-op*2*pi/h));
		for(int j=0;j<len;j+=h){
			cp E(1,0);
			for(int k=j;k<j+h/2;++k){
				cp u=F[k];
				cp v=E*F[k+h/2];
				F[k]=u+v;
				F[k+h/2]=u-v;
				E=E*wn;
			}
		}
	}
	if(op==-1)for(int i=0;i<len;++i)F[i].r/=len;
}
void conv(cp a[],cp b[],int len){
	FFT(a,len,1);
	FFT(b,len,1);
	for(int i=0;i<len;++i)a[i]=a[i]*b[i];
	FFT(a,len,-1);
}
char s1[maxn>>2],s2[maxn>>2];
int ans[maxn],len,h;
void init(){
	int l1=strlen(s1),l2=strlen(s2);len=1;
	reverse(s1,s1+l1),reverse(s2,s2+l2);
	while(len<l1+l2)len<<=1;
	for(int i=0;i<l1;++i)va[i]=cp(s1[i]-'0',0);
	for(int i=l1;i<len;++i)va[i]=cp(0,0);
	for(int i=0;i<l2;++i)vb[i]=cp(s2[i]-'0',0);
	for(int i=l2;i<len;++i)vb[i]=cp(0,0);
	conv(va,vb,len);
	memset(ans,0,sizeof(ans));
	h=0;
}
int main(){
	while(gets(s1)!=NULL,gets(s2)!=NULL){
		init();
		for(int i=0;i<len;++i)ans[i]=va[i].r+0.5;
		for(int i=0;i<len;++i)ans[i+1]+=ans[i]/10,ans[i]%=10;
		for(int i=len-1;~i;--i)if(ans[i]){
			h=i;break;
		}
		for(int i=h;~i;--i)putchar(ans[i]+'0');
		putchar('\n');
	}
	return 0;
}