【uoj34】NTT模板

转载质数原根表：
http://blog.miskcoo.com/2014/07/fft-prime-table

#include<cstdio>
#include<iostream>
#include<algorithm>
#define ll long long
using namespace std;
inline int read()
{
    int x=0,f=1;char ch=getchar();
    while (ch<'0'||ch>'9'){if (ch=='-') f=-1;ch=getchar();}
    while (ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
    return x*f;
}
const ll mod=998244353;
ll a[300005],b[300005];
int n,m,M,R[300005],L;

ll power(ll a,ll b)
{
    ll ans=1;
    while (b)
    {
        if (b&1) ans=ans*a%mod;
        b>>=1LL;a=a*a%mod;
    }
    return ans;
}

void NTT(ll *a,int f)
{
    for (int i=0;i<n;i++) if (i<R[i]) swap(a[i],a[R[i]]);
    for (int i=1;i<n;i<<=1)
    {
        ll wn=power(3,(mod-1)/(i<<1));//类似单位复根
        for (int j=0;j<n;j+=(i<<1))
        {
            ll w=1LL;
            for (int k=0;k<i;k++,w=w*wn%mod)
            {
                ll x=a[j+k],y=a[j+k+i]*w%mod;
                a[j+k]=(x+y)%mod;a[j+k+i]=(x-y+mod)%mod;
            }
        }
    }
    if (f==-1) reverse(a+1,a+n);//简单得认为反过来相当于倒着算
}

int main()
{
    n=read();m=read();
    for (int i=0;i<=n;i++) scanf("%lld",&a[i]);
    for (int i=0;i<=m;i++) scanf("%lld",&b[i]);
    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]=(a[i]*b[i])%mod;
    NTT(a,-1);

    ll inv=power(n,mod-2);
    for (int i=0;i<n;i++) a[i]=(a[i]*inv)%mod;
    for (int i=0;i<=M;i++) printf("%lld ",a[i]);
    return 0;
}