Valuable Forests

AC代码：

#include<bits/stdc++.h>
using namespace std;
int n;
int t,mod;
int num[100010];
int a[100010],st[5010];
int C[5010][5010],A[5010],F[5010],f[5010];
int fastpow(int x,int a)
{
    int ans=1;
    for (; a; x=1ll*x*x%mod,a>>=1)
        if (a&1) ans=1ll*ans*x%mod;
    return ans;
}
int main()
{
    scanf("%d%d",&t,&mod);
    C[0][0]=1;
    for (int i=1; i<=5000; i++)
    {
        C[0][i]=1;
        for (int j=1; j<=i; j++)
            C[j][i]=(1ll*C[j][i-1]+C[j-1][i-1])%mod;
    }
    st[0]=1;
    st[1]=1;
    for (int N=1; N<=5000; N++)
    {
        for (int d=1; d<=N-1; d++)
            A[N]=(1ll*d*d*C[d-1][N-2]%mod*fastpow(N-1,N-2-d+1)+A[N])%mod;
        A[N]=1ll*N*A[N]%mod;
        if (N>1) st[N]=fastpow(N,N-2);
    }
    f[0]=1;
    f[1]=1;
    for (int i=2; i<=5000; i++)
        for (int j=0; j<i; j++)
            f[i]=(1ll*C[j][i-1]*f[i-j-1]%mod*st[j+1]+f[i])%mod;
    for (int N=2; N<=5000; N++)
        for (int i=1; i<=N; i++)
            F[N]=(1ll*C[i-1][N-1]*((1ll*st[i]*F[N-i]%mod+1ll*f[N-i]*A[i]%mod)%mod)+F[N])%mod;
    while(t--)
    {
        scanf("%d",&n);
        printf("%d\n",F[n]);
    }
}