nowcoder19797 导数卷积

链接

点击跳转

题解

$$\begin{gathered} an{s}_d=\sum _{i=0}^{n-1}[x^d]\left(f^{(i)}{f}^{(n-1-i)}\right) \\ =\sum _{i=0}^{n-1}\sum _{j=0}^d\left([x^j]f^{(i)}\right)\left([x^{(d-j)}]f^{(n-1-i)}\right) \\ =\sum _{i=0}^{n-1}\sum _{j=0}^d\left(\frac{(j+i)!}{j!}[x^{j+i}]f^{(i)}\right)\left(\frac{(d-j+n-1-i)!}{(d-j)!}[x^{(d-j+n-1-i)}]f^{(n-1-i)}\right) \\ =\sum _{i=0}^{n-1}\sum _{j=0}^d\frac{(j+i)!}{j!}{a}_{j+i}\frac{(d-j+n-1-i)!}{(d-j)!}{a}_{d-j+n-1-i}) \end{gathered}$$

令$b_i=i!a_i$

则上式
$$\begin{gathered} =\sum _{i=0}^{n-1}\sum _{j=0}^d\frac{b_{i+j}}{j!}\frac{b_{d-j+n-1-i}}{(d-j)!} \\ =\sum _{j=0}^d\frac{j!}{(d-j)!}\sum _{i=0}^{n-1}{b}_{i+j}{b}_{d-j+n-1-i} \end{gathered}$$

观察这个东西：

$$\sum _{i=0}^{n-1}{b}_{i+j}{b}_{d-j+n-1-i}$$

通过分析$j=0,j=1,j=d$，可以发现无论$j$取什么值，这个和式的计算过程（除了首尾一些$0$值外）都不变，这个值就是对多项式$b_0+b_1{x}^1+b_2{x}^2+\cdots +b_{n-1}{x}^{n-1}$平方之后得到的多项式的$n-1+d$次方项系数，记为$c_{n-1+d}$

那么就是求
$$\sum _{j=0}^d\frac{1}{j!(d-j)!}{c}_{n-1-d}=c_{n-1-d}\sum _{j=0}^d\frac{1}{j!(d-j)!}$$

只需求
$$\sum _{j=0}^d\frac{1}{j!(d-j)!}$$

看到这个式子，给人一种强烈的要给分子乘以$d!$的欲望，好那我就分子乘以$d!$

那么就得到
$$\sum _{j=0}^d\left(\genfrac{}{}{0ex}{}{d}{j}\right)=2^d$$

所以答案就是
$$an{s}_d=\frac{2^d}{d!}{c}_{n-1+d}$$

代码

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define iinf 0x3f3f3f3f
#define linf (1ll<<60)
#define eps 1e-8
#define maxn (262144+10)
#define cl(x) memset(x,0,sizeof(x))
#define rep(i,a,b) for(i=a;i<=b;i++)
#define em(x) emplace(x)
#define emb(x) emplace_back(x)
#define emf(x) emplace_front(x)
#define fi first
#define se second
#define de(x) cerr<<#x<<" = "<<x<<endl
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
ll read(ll x=0)
{
    ll c, f(1);
    for(c=getchar();!isdigit(c);c=getchar())if(c=='-')f=-f;
    for(;isdigit(c);c=getchar())x=x*10+c-0x30;
    return f*x;
}
#define mod 998244353ll
struct EasyMath
{
    ll prime[maxn], phi[maxn], mu[maxn];
    bool mark[maxn];
    ll fastpow(ll a, ll b, ll c)
    {
        ll t(a%c), ans(1ll);
        for(;b;b>>=1,t=t*t%c)if(b&1)ans=ans*t%c;
        return ans;
    }
    void exgcd(ll a, ll b, ll &x, ll &y)
    {
        if(!b){x=1,y=0;return;}
        ll xx, yy;
        exgcd(b,a%b,xx,yy);
        x=yy, y=xx-a/b*yy;
    }
    ll inv(ll x, ll p)  //p是素数
    {return fastpow(x%p,p-2,p);}
    ll inv2(ll a, ll p)
    {
        ll x, y;
        exgcd(a,p,x,y);
        return (x+p)%p;
    }
    void shai(ll N)
    {
        ll i, j;
        for(i=2;i<=N;i++)mark[i]=false;
        *prime=0;
        phi[1]=mu[1]=1;
        for(i=2;i<=N;i++)
        {
            if(!mark[i])prime[++*prime]=i, mu[i]=-1, phi[i]=i-1;
            for(j=1;j<=*prime and i*prime[j]<=N;j++)
            {
                mark[i*prime[j]]=true;
                if(i%prime[j]==0)
                {
                    phi[i*prime[j]]=phi[i]*prime[j];
                    break;
                }
                mu[i*prime[j]]=-mu[i];
                phi[i*prime[j]]=phi[i]*(prime[j]-1);
            }
        }
    }
    ll CRT(vector<ll> a, vector<ll> m) //要求模数两两互质
    {
        ll M=1, ans=0, n=a.size(), i;
        for(i=0;i<n;i++)M*=m[i];
        for(i=0;i<n;i++)(ans+=a[i]*(M/m[i])%M*inv2(M/m[i],m[i]))%=M;
        return ans;
    }
}em;
struct NTT
{
    ll n, R[maxn], a[maxn], b[maxn];
    void init(ll bound)    //bound是积多项式的最高次幂
    {
        ll L(0);
        for(n=1;n<=bound;n<<=1,L++);
        for(ll i=0;i<n;i++)R[i]=(R[i>>1]>>1)|((i&1)<<(L-1)), a[i]=b[i]=0;
    }
    void ntt(ll* a, int opt)
    {
        ll i, j, k, wn, w, x, y, inv(em.fastpow(n,mod-2,mod));
        for(i=0;i<n;i++)if(i>R[i])swap(a[i],a[R[i]]);
        for(i=1;i<n;i<<=1)
        {
            if(opt==1)wn=em.fastpow(3,(mod-1)/(i<<1),mod);
            else wn=em.fastpow(3,(mod-1-(mod-1)/(i<<1)),mod);
            for(j=0;j<n;j+=i<<1)
                for(w=1,k=0;k<i;k++,w=w*wn%mod)
                {
                    x=a[k+j], y=a[k+j+i]*w%mod;
                    a[k+j]=(x+y)%mod, a[k+j+i]=(x-y)%mod;
                }
        }
        if(opt==-1)for(i=0;i<n;i++)(a[i]*=inv)%=mod;
    }
    void mult()
    {
        ntt(a,1), ntt(b,1);
        for(int i=0;i<n;i++)(a[i]*=b[i])%=mod;
        ntt(a,-1);
    }
}ntt;
ll fact[maxn];
int main()
{
    ll n=read(), i;
    ntt.init(2*n-2);
    fact[0]=1; rep(i,1,n)fact[i]=fact[i-1]*i%mod;
    rep(i,0,n-1)ntt.a[i]=read();
    rep(i,0,n-1)ntt.a[i]=ntt.a[i]*fact[i]%mod;
    rep(i,0,n-1)ntt.b[i]=ntt.a[i];
    ntt.mult();
    rep(i,0,n-1)
    {
        ll ans=ntt.a[n-1+i]*em.fastpow(2,i,mod)%mod*em.inv(fact[i],mod)%mod;
        printf("%lld ",(ans+mod)%mod);
    }
    return 0;
}