//Place your snippets for cpp here. Each snippet is defined under a snippet name and has a prefix, body and 
// description. The prefix is what is used to trigger the snippet and the body will be expanded and inserted. Possible variables are:
// $1, $2 for tab stops, $0 for the final cursor position, and ${1:label}, ${2:another} for placeholders. Placeholders with the 
// same ids are connected.
// prefix 的格式要求是 acm-[一级标题编号].[二级标题编号][该代码片段的英文简称]
// description 的格式要求是 "插入 [该代码片段的中文名]"

{
    "多项式 快速幂": {
        "prefix": "acm-7.4nlog^2n 暴力",
        "body": [
            "#include<algorithm>",
            "#include<cstring>",
            "#include<cstdio>",
            "#define LL long long",
            "#define Re register int ",
            "using namespace std;",
            "const int N=262144+3,P=998244353,G=3,phi=P-1;",
            "inline void in(Re &x){",
            "\tint f=0;x=0;char ch=getchar();",
            "\twhile(ch<'0'||ch>'9')f|=ch=='-',ch=getchar();",
            "\twhile(ch>='0'&&ch<='9')x=(x<<1)+(x<<3)+(ch^48),ch=getchar();",
            "\tx=f?-x:x;",
            "}",
            "inline int in_(){",
            "\tint f=0;LL x=0;char ch=getchar();",
            "\twhile(ch<'0'||ch>'9')ch=getchar();",
            "\twhile(ch>='0'&&ch<='9')x=x*10+(ch^48),x%=P,ch=getchar();",
            "\treturn x;",
            "}",
            "inline int mi(Re x,Re k){",
            "\tRe s=1;",
            "\twhile(k){",
            "\t\tif(k&1)s=(LL)s*x%P;",
            "\t\tx=(LL)x*x%P,k>>=1;",
            "\t}",
            "\treturn s;",
            "}",
            "inline int inv(Re x){return mi(x,P-2);}",
            "int invG,tr[N];",
            "inline void NTT(Re *f,Re n,Re op){",
            "\tfor(Re i=1;i<n;++i)if(i<tr[i])swap(f[i],f[tr[i]]);",
            "\tfor(Re p=2;p<=n;p<<=1)",
            "\t\tfor(Re st=0,len=p>>1,w1=mi(op?invG:G,(P-1)/p);st<n;st+=p)",
            "\t\t\tfor(Re i=st,base=1;i<=st+len-1;++i){",
            "\t\t\t\tRe tmp=(LL)f[i+len]*base%P;",
            "\t\t\t\tf[i+len]=(f[i]-tmp+P)%P,(f[i]+=tmp)%=P,base=(LL)base*w1%P;",
            "\t\t\t}",
            "}",
            "inline void times(Re *f,Re n,Re *g,Re m){",
            "\tRe n_=n,m_=m;",
            "\tfor(m+=n,n=1;n<=m;n<<=1);invG=inv(G);",
            "\tfor(Re i=n_+1;i<n;++i)f[i]=0;",
            "\tfor(Re i=m_+1;i<n;++i)g[i]=0;",
            "\tfor(Re i=1;i<n;++i)tr[i]=(tr[i>>1]>>1)|((i&1)?n>>1:0);",
            "\tNTT(f,n,0),NTT(g,n,0);",
            "\tfor(Re i=0;i<n;++i)f[i]=(LL)f[i]*g[i]%P;",
            "\tNTT(f,n,1);Re invn=inv(n);",
            "\tfor(Re i=0;i<=m;++i)f[i]=(LL)f[i]*invn%P;",
            "}",
            "int c[N];",
            "inline void polymi(Re *x,Re n,Re k,Re *s){",
            "\tk%=P,s[0]=1;",
            "\tfor(Re i=1;i<=n;++i)s[i]=0;",
            "\twhile(k){",
            "\t\tif(k&1){for(Re i=0;i<=n;++i)c[i]=x[i];times(s,n,c,n);}",
            "\t\tfor(Re i=0;i<=n;++i)c[i]=x[i];times(x,n,c,n),k>>=1;",
            "\t}",
            "}",
            "int n,K,f[N],g[N];",
            "int main(){",
            "//\tfreopen(\"123.txt\",\"r\",stdin);",
            "\tin(n),--n,K=in_();",
            "\tfor(Re i=0;i<=n;++i)in(f[i]);",
            "\tpolymi(f,n,K,g);",
            "\tfor(Re i=0;i<=n;++i)printf(\"%d \",g[i]);",
            "}",
            ""
        ],
        "description": "插入 多项式 快速幂"
    }
}