传送门
解析:
一下设 w 4 w_4 w4为四次单位根,即在当前数域下, w 4 4 = 1 w_4^4=1 w44=1。一般 N T T NTT NTT模数下都有四次单位根。而复数中的四次单位根其实就是 i i i。
由 exp , sin , cos \exp,\sin,\cos exp,sin,cos的泰勒展开:
exp ( x ) = 1 + x + x 2 2 ! + x 3 3 ! + x 4 4 ! + … sin ( x ) = x − x 3 3 ! + x 5 5 ! − x 7 7 ! + x 9 9 ! + … cos ( x ) = 1 − x 2 2 ! + x 4 4 ! − x 6 6 ! + x 8 8 ! + … \begin{aligned} \exp(x)=1+x+\frac{x^2}{2!}+\frac{x^3}{3!}+\frac{x^4}{4!}+…\\ \sin(x)=x-\frac{x^3}{3!}+\frac{x^5}{5!}-\frac{x^7}{7!}+\frac{x^9}{9!}+…\\ \cos(x)=1-\frac{x^2}{2!}+\frac{x^4}{4!}-\frac{x^6}{6!}+\frac{x^8}{8!}+… \end{aligned} exp(x)=1+x+2!x2+3!x3+4!x4+…sin(x)=x−3!x3+5!x5−7!x7+9!x9+…cos(x)=1−2!x2+4!x4−6!x6+8!x8+…
我们有欧拉公式: exp ( i x ) = cos ( x ) + i sin ( x ) \exp(ix)=\cos(x)+i\sin(x) exp(ix)=cos(x)+isin(x)
那么取一个负数解方程得到: cos ( x ) = exp ( i x ) + exp ( − i x ) 2 sin ( x ) = exp ( i x ) − exp ( − i x ) 2 i \cos(x)=\frac{\exp(ix)+\exp(-ix)}{2}\\\sin(x)=\frac{\exp(ix)-\exp(-ix)}{2i} cos(x)=2exp(ix)+exp(−ix)sin(x)=2iexp(ix)−exp(−ix)
代码:
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define re register
#define gc get_char
#define cs const
namespace IO{
inline char get_char(){
static cs int Rlen=1<<20|1;
static char buf[Rlen],*p1,*p2;
return (p1==p2)&&(p2=(p1=buf)+fread(buf,1,Rlen,stdin),p1==p2)?EOF:*p1++;
}
inline int getint(){
re char c;
while(!isdigit(c=gc()));re int num=c^48;
while(isdigit(c=gc()))num=(num+(num<<2)<<1)+(c^48);
return num;
}
}
using namespace IO;
cs int mod=998244353;
inline int add(int a,int b){return a+b>=mod?a+b-mod:a+b;}
inline int dec(int a,int b){return a<b?a-b+mod:a-b;}
inline int mul(int a,int b){return (ll)a*b%mod;}
inline int quickpow(int a,int b,int res=1){
while(b){
if(b&1)res=mul(res,a);
a=mul(a,a);
b>>=1;
}
return res;
}
typedef vector<int> Poly;
cs int N=410000;
int r[N],inv[N];
inline void NTT(Poly &A,int len,int typ){
if(typ==-1)reverse(A.begin()+1,A.begin()+len);
for(int re i=0;i<len;++i)if(i<r[i])swap(A[i],A[r[i]]);
for(int re i=1;i<len;i<<=1){
int wn=quickpow(3,(mod-1)/i/2);
for(int re j=0;j<len;j+=i<<1)
for(int re k=0,x,y,w=1;k<i;++k,w=mul(w,wn)){
x=A[j+k],y=mul(w,A[j+k+i]);
A[j+k]=add(x,y);
A[j+k+i]=dec(x,y);
}
}
if(typ==-1)for(int re i=0;i<len;++i)A[i]=mul(A[i],inv[len]);
}
inline void init_rev(int len){
for(int re i=0;i<len;++i)r[i]=r[i>>1]>>1|((i&1)*(len>>1));
}
inline Poly operator*(Poly a,Poly b){
int deg=a.size()+b.size()-1,l=1;
while(l<deg)l<<=1;
init_rev(l);
a.resize(l),NTT(a,l,1);
b.resize(l),NTT(b,l,1);
for(int re i=0;i<l;++i)a[i]=mul(a[i],b[i]);
NTT(a,l,-1);
a.resize(deg);
return a;
}
inline Poly operator+(cs Poly &a,cs Poly &b){
Poly c=a;c.resize(max(a.size(),b.size()));
for(int re i=0;i<b.size();++i)c[i]=add(c[i],b[i]);
return c;
}
inline Poly operator-(cs Poly &a,cs Poly &b){
Poly c=a;c.resize(max(a.size(),b.size()));
for(int re i=0;i<b.size();++i)c[i]=dec(c[i],b[i]);
return c;
}
inline Poly operator*(Poly a,cs int &b){
for(int re i=0;i<a.size();++i)a[i]=mul(a[i],b);
return a;
}
inline Poly Deriv(Poly a){
for(int re i=0;i+1<a.size();++i)a[i]=mul(a[i+1],i+1);
a.pop_back();
return a;
}
inline Poly Integ(Poly a){
a.push_back(0);
for(int re i=a.size()-1;i;--i)a[i]=mul(a[i-1],inv[i]);
a[0]=0;
return a;
}
inline Poly Inv(cs Poly &a,int lim){
Poly c,b(1,quickpow(a[0],mod-2));
for(int re l=4;(l>>2)<lim;l<<=1){
c=a,c.resize(l>>1);
init_rev(l);
c.resize(l),NTT(c,l,1);
b.resize(l),NTT(b,l,1);
for(int re i=0;i<l;++i)b[i]=mul(b[i],dec(2,mul(b[i],c[i])));
NTT(b,l,-1);
b.resize(l>>1);
}
b.resize(lim);
return b;
}
inline Poly Inv(cs Poly &a){return Inv(a,a.size());}
inline Poly Ln(Poly a,int lim){
a=Integ(Deriv(a)*Inv(a,lim));
a.resize(lim);
return a;
}
inline Poly Ln(cs Poly &a){return Ln(a,a.size());}
inline Poly Exp(cs Poly &a,int lim){
Poly c,b(1,1);int n=a.size();
for(int re i=2;(i>>1)<lim;i<<=1){
c=Ln(b,i);
for(int re j=0;j<i;++j)c[j]=dec(j<n?a[j]:0,c[j]);
c[0]=add(1,c[0]);
b=b*c;
b.resize(i);
}
b.resize(lim);
return b;
}
inline Poly Exp(cs Poly &a){return Exp(a,a.size());}
cs int w4=quickpow(3,(mod-1)/4),inv2=(mod+1)/2;
inline Poly Cos(cs Poly &a,int lim){
Poly c=a;c.resize(lim);
c=(Exp(c*w4)+Exp(c*(mod-w4)))*inv2;
return c;
}
inline Poly Cos(cs Poly &a){return Cos(a,a.size());}
inline Poly Sin(cs Poly &a,int lim){
Poly c=a;c.resize(lim);
c=(Exp(c*w4)-Exp(c*(mod-w4)))*mul(inv2,quickpow(w4,mod-2));
return c;
}
inline Poly Sin(cs Poly &a){return Sin(a,a.size());}
inline void init_inv(){
inv[0]=inv[1]=1;
for(int re i=2;i<N;++i)inv[i]=mul(mod-mod/i,inv[mod%i]);
}
inline void print(cs Poly &a){
for(int re i=0;i<a.size();++i)cout<<a[i]<<" ";
}
Poly a;
int typ;
signed main(){
init_inv();
a.resize(getint());
typ=getint();
for(int re i=0;i<a.size();++i)a[i]=getint();
print(typ?Cos(a):Sin(a));
return 0;
}