loj108 多项式乘法（FFT模板题）

手写complex，大概可以快了一倍吧qaq
我认输，我手写complex还不行吗！
因为是模拟大整数乘法，所以最后的系数最大不超过1e5*9*9，因此也可以ntt。

FFT

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <complex>
#include <cmath>
using namespace std;
#define ll long long
#define inf 0x3f3f3f3f
#define N 100010
#define pi acos(-1)
inline char gc(){
    static char buf[1<<16],*S,*T;
    if(S==T){T=(S=buf)+fread(buf,1,1<<16,stdin);if(T==S) return EOF;}
    return *S++;
}
inline int read(){
    int x=0,f=1;char ch=gc();
    while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=gc();}
    while(ch>='0'&&ch<='9') x=x*10+ch-'0',ch=gc();
    return x*f;
}
struct E{
    double a,b;
    E(){}
    E(double _a,double _b){a=_a;b=_b;}
    E operator+(E x){return E(a+x.a,b+x.b);}
    E operator-(E x){return E(a-x.a,b-x.b);}
    E operator*(E x){return E(a*x.a-b*x.b,a*x.b+b*x.a);}
    void operator/=(double x){a/=x;b/=x;}
};
int n,m,L,R[N<<2];
E a[N<<2],b[N<<2];
inline void fft(E *a,int f){
    for(int i=0;i<n;++i) if(R[i]>i) swap(a[R[i]],a[i]);
    for(int i=1;i<n;i+=i){
        E wn(cos(pi/i),f*sin(pi/i));
        for(int j=0,p=i<<1;j<n;j+=p){
            E w(1,0);
            for(int k=0;k<i;++k,w=w*wn){
                E x=a[j+k],y=a[j+k+i]*w;
                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(){
//  freopen("a.in","r",stdin);
    n=read();m=read();
    for(int i=0;i<=n;++i) a[i].a=read();
    for(int i=0;i<=m;++i) b[i].a=read();
    m=n+m;for(n=1;n<=m;n<<=1) ++L;
    for(int i=0;i<n;++i) R[i]=(R[i>>1]>>1)|(i&1)<<L-1;
    fft(a,1);fft(b,1);
    for(int i=0;i<n;++i) a[i]=a[i]*b[i];fft(a,-1);
    for(int i=0;i<=m;++i) printf("%d ",(int)(a[i].a+0.5));
    return 0; 
}

NTT

#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
#define ll long long
#define inf 0x3f3f3f3f
#define N 100010
#define G 3
#define mod 998244353
inline char gc(){
    static char buf[1<<16],*S,*T;
    if(S==T){T=(S=buf)+fread(buf,1,1<<16,stdin);if(T==S) return EOF;}
    return *S++;
}
inline int read(){
    int x=0,f=1;char ch=gc();
    while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=gc();}
    while(ch>='0'&&ch<='9') x=x*10+ch-'0',ch=gc();
    return x*f;
}
int n,m,L,R[N<<2],a[N<<2],b[N<<2];
inline int ksm(int x,int k){
    int res=1;for(;k;k>>=1,x=(ll)x*x%mod) if(k&1) res=(ll)res*x%mod;return res;
}
inline void ntt(int *a,int f){
    for(int i=0;i<n;++i) if(R[i]>i) swap(a[R[i]],a[i]);
    for(int i=1;i<n;i+=i){
        int wn=ksm(G,f==1?(mod-1)/(i*2):mod-1-(mod-1)/(i*2));
        for(int j=0,p=i<<1;j<n;j+=p){
            int w=1;
            for(int k=0;k<i;++k,w=(ll)w*wn%mod){
                int x=a[j+k],y=(ll)a[j+k+i]*w%mod;
                a[j+k]=(x+y)%mod;a[j+k+i]=(x-y)%mod;
            }
        }
    }if(f==1) return;int invn=ksm(n,mod-2);
    for(int i=0;i<n;++i) a[i]=(ll)a[i]*invn%mod;
}
int main(){
//  freopen("a.in","r",stdin);
    n=read();m=read();
    for(int i=0;i<=n;++i) a[i]=read();
    for(int i=0;i<=m;++i) b[i]=read();
    m=n+m;for(n=1;n<=m;n<<=1) ++L;
    for(int i=0;i<n;++i) R[i]=(R[i>>1]>>1)|(i&1)<<L-1;
    ntt(a,1);ntt(b,1);
    for(int i=0;i<n;++i) a[i]=(ll)a[i]*b[i]%mod;ntt(a,-1);
    for(int i=0;i<=m;++i) printf("%d ",a[i]<0?a[i]+mod:a[i]);
    return 0; 
}