P1919 【模板】A*B Problem升级版（FFT快速傅里叶）

题目链接：点击进入

题目

思路

对于n位的十进制数可以看作n-1位的多项式：
x = a[0] + a[1] * 10 ^ 1 + a[2] * 10 ^ 2 + … +a[n-1] * 10 ^ (n-1)
两个大数相乘就相当于两个多项式相乘，那么就可以采用FFT

代码

#include<iostream>
#include<string>
#include<map>
#include<set>
//#include<unordered_map>
#include<queue>
#include<cstdio>
#include<vector>
#include<cstring>
#include<stack>
#include<algorithm>
#include<iomanip>
#include<cmath>
#include<fstream>
#define X first
#define Y second
#define best 131 
#define INF 0x3f3f3f3f3f3f3f3f
#define pii pair<int,int>
#define lowbit(x) x & -x
#define inf 0x3f3f3f3f
//#define int long long
//#define double long double
//#define rep(i,x,y) for(register int i = x; i <= y;++i)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const double pai=acos(-1.0);
const int maxn=3e6+10;
const int mod=998244353;
const double eps=1e-9;
const int N=5e3+10;
char s1[maxn],s2[maxn];
int n,ans[maxn];
int lim=1,len,rev[maxn]; 
struct node
{
    double x,y;
    node(double xx=0,double yy=0){x=xx,y=yy;}
    node operator * (node Q){return node(x*Q.x-y*Q.y,x*Q.y+y*Q.x);}
	node operator + (node Q){return node(x+Q.x,y+Q.y);}
	node operator - (node Q){return node(x-Q.x,y-Q.y);}
}a[maxn],b[maxn];

//inline int read()
//{
//    int k = 0, f = 1 ;
//    char c = getchar() ;
//    while(!isdigit(c)){if(c == '-') f = -1 ;c = getchar() ;}
//    while(isdigit(c)) k = (k << 1) + (k << 3) + c - 48 ,c = getchar() ;
//    return k * f ;
//}

inline void fft(node *A,double flag)
{
    for(int i=0;i<lim;i++)
        if(i<rev[i]) 
			swap(A[i],A[rev[i]]);
    for(int i=1;i<lim;i<<=1)
	{
        node wn(cos(pai/i),flag*sin(pai/i));
        for(int j=0;j<lim;j+=(i<<1))
		{
            node w(1,0);
            for(int k=0;k<i;k++,w=w*wn) 
			{
                node nx=A[j+k],ny=w*A[j+i+k];
                A[j+k]=nx+ny;
                A[j+i+k]=nx-ny ;
            }
        }
    }
}
int main()
{
    scanf("%s%s",s1,s2);
    int l1=strlen(s1);
    int l2=strlen(s2);
    for(int i=0;i<l1;i++) a[i].x=s1[l1-i-1]-48;
    for(int i=0;i<l2;i++) b[i].x=s2[l2-i-1]-48;
    while(lim<l1+l2) lim<<=1,len++;
    for(int i=0;i<=lim;i++) rev[i]=(rev[i>>1]>>1)|((i&1)<<(len-1)) ;
    fft(a,1);
	fft(b,1);
    for(int i=0;i<=lim;i++) a[i]=a[i]*b[i];
    fft(a,-1);
	for(int i=0;i<=lim;i++) 
	{
        ans[i]+=(int)(a[i].x/lim+0.5);
        if(ans[i]>=10) 
            ans[i+1]+=ans[i]/10,ans[i]%=10,lim+=(i==lim);
    }
    while(!ans[lim]&&lim>=1) lim--;
    lim++;
	while(--lim>=0) cout<<ans[lim]; 
    return 0;
}