[HZOI 2015] 释迦

题目描述：

多项式乘法，结果对 23333333 取模

题目分析：

用FFT实现MTT，详见这里
跑的好慢啊…

题目链接：

COGS 2294

Ac 代码：

#include <cstring>
#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cmath>
#define ll long long
#define double long double
const double PI=std::acos(-1);
const int M=32768,p=23333333;
const int maxm=500003;
struct complex{
    double real,imag;
    complex(){};
    complex(double _real,double _imag):real(_real),imag(_imag){}
};
inline complex operator + (complex x,complex y){return (complex){x.real+y.real,x.imag+y.imag};}
inline complex operator - (complex x,complex y){return (complex){x.real-y.real,x.imag-y.imag};}
inline complex operator * (complex x,complex y){return (complex){x.real*y.real-x.imag*y.imag,x.real*y.imag+y.real*x.imag};}
int rev[maxm],bin[1<<19+1];
inline void FFT(complex *a,int n,int f)
{
    int l=bin[n];
    for(int i=0;i<n;i++) rev[i]=((rev[i>>1]>>1)|((i&1)<<(l-1)));
    for(int i=0;i<n;i++) if(i<rev[i]) std::swap(a[i],a[rev[i]]);
    for(int i=1;i<n;i<<=1)
    {
        complex wn=(complex){std::cos(PI/i),f*std::sin(PI/i)};
        for(int j=0;j<n;j+=(i<<1))
        {
            complex w=(complex){1,0};
            for(int k=0;k<i;k++,w=(w*wn))
            {
                complex x=a[j+k],y=a[i+j+k]*w;
                a[j+k]=x+y,a[i+j+k]=x-y;
            }
        }
    }
    if(f==-1) for(int i=0;i<n;i++) a[i].real/=(double)n;
}
ll ans[maxm];
int F[maxm],G[maxm];
complex a[maxm],b[maxm],c[maxm],d[maxm],e[maxm],f[maxm],g[maxm],h[maxm];
int n,m;
inline void MTT()
{
    int m=1;
    for(;m<=2*n;m<<=1);
    for(int i=0;i<m;i++)
    {
        a[i].real=F[i]/M,b[i].real=F[i]%M;
        c[i].real=G[i]/M,d[i].real=G[i]%M;
    }
    FFT(a,m,1),FFT(b,m,1),FFT(c,m,1),FFT(d,m,1);
    for(int i=0;i<m;i++)
    {
        e[i]=a[i]*c[i],f[i]=a[i]*d[i];
        g[i]=b[i]*c[i],h[i]=b[i]*d[i];
    }
    FFT(e,m,-1),FFT(f,m,-1),FFT(g,m,-1),FFT(h,m,-1);
    for(int i=0;i<m;i++)
    {
        ans[i]=(ll)(round(e[i].real))%p*M%p*M%p;
        ans[i]+=(ll)(round(f[i].real))%p*M%p;
        ans[i]+=(ll)(round(g[i].real))%p*M%p;
        ans[i]+=(ll)(round(h[i].real))%p;
        ans[i]%=p;
    }
}
int main()
{
    freopen("annona_squamosa.in","r",stdin);
    freopen("annona_squamosa.out","w",stdout);
    for(int i=0;i<=19;i++) bin[1<<i]=i;
    scanf("%d",&n);
    for(int i=0;i<n;i++) scanf("%d",&F[i]);
    for(int i=0;i<n;i++) scanf("%d",&G[i]);
    MTT();
    for(int i=0;i<n;i++) printf("%lld\n",ans[i]);
    return 0;
}