2179: FFT快速傅立叶
Time Limit: 10 Sec Memory Limit: 259 MBSubmit: 3148 Solved: 1626
[ Submit][ Status][ Discuss]
Description
给出两个n位10进制整数x和y,你需要计算x*y。
Input
第一行一个正整数n。 第二行描述一个位数为n的正整数x。 第三行描述一个位数为n的正整数y。
Output
输出一行,即x*y的结果。
Sample Input
1
3
4
3
4
Sample Output
12
数据范围:
n<=60000
数据范围:
n<=60000
HINT
Source
题解:FFT
把要运算的两个数,转化成多项式的次数,然后用FFT求解
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<cmath>
#define N 200003
#define pi acos(-1)
using namespace std;
struct data{
double x,y;
data(double X=0,double Y=0) {
x=X,y=Y;
}
}a[N],b[N];
data operator +(data a,data b){
return data(a.x+b.x,a.y+b.y);
}
data operator -(data a,data b){
return data(a.x-b.x,a.y-b.y);
}
data operator *(data a,data b){
return data(a.x*b.x-a.y*b.y,a.y*b.x+a.x*b.y);
}
int n,m,c[N];
char s[N];
void fft(data x[N],int n,int opt)
{
if (n==1) return;
data l[n>>1],r[n>>1];
for (int i=0;i<n;i+=2)
l[i>>1]=x[i],r[i>>1]=x[i+1];
fft(l,n>>1,opt); fft(r,n>>1,opt);
data wn=data(cos(2*pi/n),sin(opt*2*pi/n));
data w=data(1,0),t;
for (int i=0;i<n>>1;i++,w=w*wn)
t=w*r[i],x[i]=l[i]+t,x[i+(n>>1)]=l[i]-t;
}
int main()
{
freopen("a.in","r",stdin);
scanf("%d",&n); n--;
scanf("%s",s);
for (int i=0;i<=n;i++) a[i].x=s[n-i]-'0';
scanf("%s",s);
for (int i=0;i<=n;i++) b[i].x=s[n-i]-'0';
m=2*n;
for (n=1;n<=m;n<<=1);
fft(a,n,1); fft(b,n,1);
for (int i=0;i<=n;i++) a[i]=a[i]*b[i];
fft(a,n,-1);
for (int i=0;i<=m;i++) c[i]=(int)(a[i].x/n+0.1);
//for (int i=0;i<=m;i++) cout<<c[i]<<" ";
//cout<<endl;
for (int i=0;i<=m;i++) {
c[i+1]+=c[i]/10;
c[i]%=10;
}
while (c[m+1]) {
m++; c[m+1]+=c[m]/10;
c[m]%=10;
}
for (int i=m;i>=0;i--)
printf("%d",c[i]);
printf("\n");
}