题解 P1303 【A*B Problem】

题解 P1303 【A*B Problem】

FTT

#include<iostream>
#include<cstdio>
#include<queue>
#include<stack>
#include<algorithm>
#include<cstring>
#include<vector>
#include<ctime>
#include<map>
#include<cstdlib>
#include<cmath>
#define p puts("-1");
#define r(i,a,b) for(int i=a;i<=b;i++)
#define rr(i,a,b) for(int i=a;i>=b;i--)
#define inf 0x3f3f3f3f
#define mem(a) memset(a,0x3f,sizeof(a))
#define re(a) a=read()
#define pr(a) printf("%d\n",a)
#define me(a) memset(a,0,sizeof(a))
#define in inline
#define ll long long
#define db double
using namespace std;
const int N=10007;
const db pi=acos(-1.0);
inline int read(){
    char ch=getchar();
    int w=1,x=0;
    while(ch<'0'||ch>'9'){if(ch=='-')w=-1;ch=getchar();}
    while(ch>='0'&&ch<='9'){x=(x<<3)+(x<<1)+ch-'0',ch=getchar();}
    return x*w;
}
char s[N];
int n,m,len,limit=1,cnt=0,ans[N],tot=0,inv[N];
struct node{db x,y;}w[N],a[N],b[N];
node operator*(node a,node b){return (node){a.x*b.x-a.y*b.y,a.x*b.y+a.y*b.x};}
node operator+(node a,node b){return (node){a.x+b.x,a.y+b.y};}
node operator-(node a,node b){return (node){a.x-b.x,a.y-b.y};}
in void ftt(node *t,int type){
    r(i,0,limit-1){
        if(i<inv[i])swap(t[i],t[inv[i]]);
    }
    for(int mid=1;mid<limit;mid<<=1){
        for(int R=mid<<1,j=0;j<limit;j+=R){
            r(k,0,mid-1){
                node wn=(node){w[limit/mid*k].x,w[limit/mid*k].y*type};
                node x=t[j+k],y=wn*t[j+k+mid];
                t[j+k]=x+y,t[j+k+mid]=x-y;
            }
        }
    }
    if(type==1)return;
    r(i,0,limit-1)t[i].x/=1.0*limit;
}
int main(){
    scanf("%s",s+1);
    len=n=strlen(s+1);
    r(i,0,n-1)a[i].x=s[len--]-48;
    scanf("%s",s+1);
    len=m=strlen(s+1);
    r(i,0,m-1)b[i].x=s[len--]-48;
    while(limit<=n+m)limit<<=1,cnt++;
    for(int i=1;i<limit;i<<=1){
        r(k,0,i-1)w[limit/i*k]=(node){cos(pi*k/i),sin(pi*k/i)};
    }
    r(i,0,limit-1)inv[i]=(inv[i>>1]>>1|((i&1)<<(cnt-1)));
    ftt(a,1),ftt(b,1);
    r(i,0,limit-1)a[i]=a[i]*b[i];
    ftt(a,-1);
    tot=limit;
    me(ans);
    r(i,0,tot){
        ans[i]+=(int)(a[i].x+0.5);
        if(ans[i]>=10){
            ans[i+1]+=ans[i]/10;
            ans[i]%=10;
            tot+=(i==tot);
        }
    }
    while(!ans[tot]&&tot>=1)tot--;
    tot++;
    while(--tot>=0)printf("%d",ans[tot]);
    return 0;
}