【校内模拟】神经元（prufer序列）（DP）

题解：

度数限制直接考虑prufer序列，转移直接考虑这个点是否出现在树里面即可。

---

代码：

#include<bits/stdc++.h>
#define ll long long
#define re register
#define cs const

using std::cerr;
using std::cout;

cs int mod=1e9+7;
inline void Inc(int &a,int b){a+=b-mod;a+=a>>31&mod;}
inline int mul(int a,int b){ll r=(ll)a*b;return r>=mod?r%mod:r;}
inline int power(int a,int b,int res=1){
	for(;b;b>>=1,a=mul(a,a))(b&1)&&(res=mul(res,a));
	return res;
}

cs int N=1e2+7;

int n,d[N];

int fac[N],ifac[N];
inline void init(){
	fac[0]=fac[1]=1;
	for(int re i=2;i<=n;++i)fac[i]=mul(fac[i-1],i);
	ifac[n]=power(fac[n],mod-2);
	for(int re i=n-1;~i;--i)ifac[i]=mul(ifac[i+1],i+1);
}
inline int C(int n,int m){return mul(fac[n],mul(ifac[m],ifac[n-m]));}

int f[N][N][N];
signed main(){
#ifdef zxyoi
	freopen("neuron.in","r",stdin);
#endif
	scanf("%d",&n);init();
	for(int re i=1;i<=n;++i)scanf("%d",d+i);
	f[0][0][0]=1;
	for(int re i=0;i<n;++i)
	for(int re j=0;j<=i;++j)
	for(int re p=0;p<=n-2;++p)if(int t=f[i][j][p]){
		Inc(f[i+1][j][p],t);
		for(int re k=0,lk=std::min(d[i+1],n-1-p);k<lk;++k)
		Inc(f[i+1][j+1][p+k],mul(t,C(p+k,k)));
	}
	cout<<n<<" ";for(int re i=2;i<=n;++i)cout<<f[n][i][i-2]<<" ";
	return 0;
}