//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.4nlogn 优化倍增 NTT",
        "body": [
            "#include<algorithm>",
            "#include<cstdio>",
            "#define LL long long",
            "#define Re register int",
            "using namespace std;",
            "const int N=262144+3,P=998244353,G=3;",
            "int n,A[N],B[N];",
            "inline void in(Re &x){",
            "    int f=0;x=0;char c=getchar();",
            "    while(c<'0'||c>'9')f|=c=='-',c=getchar();",
            "    while(c>='0'&&c<='9')x=(x<<1)+(x<<3)+(c^48),c=getchar();",
            "    x=f?-x: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=0;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 j=st,base=1;j<=st+len-1;++j){",
            "\t\t\t\tRe tmp=(LL)base*f[j+len]%P;",
            "\t\t\t\tf[j+len]=(f[j]-tmp+P)%P,(f[j]+=tmp)%=P,base=(LL)base*w1%P;",
            "\t\t\t}",
            "}",
            "inline void times(Re *f,Re n,Re *g,Re m,Re op=0){",
            "\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*(op?g[i]:1)%P;",
            "\tNTT(f,n,1);Re invn=inv(n);",
            "\tfor(Re i=0;i<=m;++i)f[i]=(LL)f[i]*invn%P;",
            "}",
            "int f[N],g[N];",
            "inline void polyinv(Re *a,Re n,Re *b){",
            "\tif(n==0){b[0]=inv(a[0]);return;}",
            "\tpolyinv(a,n>>1,b);",
            "\tfor(Re i=0;i<=n;++i)f[i]=a[i],g[i]=b[i];",
            "\ttimes(f,n,g,n,1);",
            "\tfor(Re i=0;i<=n;++i)b[i]=(2*b[i]%P-f[i]+P)%P;",
            "}",
            "int main(){",
            "//    freopen(\"123.txt\",\"r\",stdin);",
            "\tin(n),--n;",
            "\tfor(Re i=0;i<=n;++i)in(A[i]),A[i]%=P;",
            "\tpolyinv(A,n,B);",
            "\tfor(Re i=0;i<=n;++i)printf(\"%d \",B[i]);",
            "}",
            ""
        ],
        "description": "插入 多项式 求逆"
    }
}