[bzoj]2179: FFT快速傅立叶

FFT做高精乘。。

#include <cstdio>
#include <string>
#include <cstring>
#include <complex>
#define node complex<double>
#define pi acos(-1)
using namespace std;
const int N=140005;
node a[N],b[N];
char s1[N],s2[N];
int le1,le2,n,m,L,r[N],c[N];
void fft(node *a,int f)
{
	register int i,j,k;
	for (i=0;i<n;i++)
	if (i<r[i]) swap(a[i],a[r[i]]);
	for (i=1;i<n;i<<=1)
	{
		node g(cos(pi/i),f*sin(pi/i));
		for (j=0;j<n;j+=(i<<1))
		{
			node w(1,0);
			for (k=0;k<i;k++,w*=g)
			{
				node x=a[j+k],y=w*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]/=n;
}
int main()
{
	register int i;
	scanf("%d",&n),n--;
	scanf("%s %s",s1,s2);	
	for (i=0;i<=n;i++)
	{
		a[i]=s1[n-i]-'0';
		b[i]=s2[n-i]-'0';
	}
	m=2*n;
	for (n=1;n<=m;n<<=1) L++;
	for (i=0;i<n;i++)
	{
		r[i]=(r[i>>1]>>1)|((i&1)<<(L-1));
	}
	fft(a,1);fft(b,1);
	for (i=0;i<=n;i++)
	{
		a[i]*=b[i];
	}
	fft(a,-1);
	for (i=0;i<=m;i++) c[i]=(int)(a[i].real()+0.1);
	for (i=0;i<=m;i++)
	if(c[i]>=10)
	{
		c[i+1]+=c[i]/10,c[i]%=10;
		if(i==m)m++;
	}
	for(i=m;i>=0;i--) printf("%d",c[i]);
	return 0;
}