Prufer序列学习笔记

连通块

• $n^{k-2}\ast \prod _{i=1}^k{s}_i$
• k为联通块数量，$s_i$为联通块大小

HNOI2004树的计数(LuoguP2290)

#include <bits/stdc++.h>
#define ll long long
using namespace std;
const int N=210;
ll T,n,ans,d[N],c[N][N];
int main()
{
	scanf("%lld%lld",&n);
	if(n==1){scanf("%lld",&d[1]);return printf(d[1]==0?"1\n":"0\n"),0;}
	for(int i=0;i<=n;i++)
	{
		c[i][0]=1;
		for(int j=1;j<=i;j++)
			c[i][j]=c[i-1][j]+c[i-1][j-1];
	}
	for(int i=1;i<=n;i++) 
	{
		scanf("%lld",d+i);
		if(!d[i]) return printf("0\n"),0;
		--d[i];
		ans+=d[i];
	}
	if(ans!=n-2) return printf("0\n"),0;
	ll sum=0;
	ans=1;
	for(int i=1;i<=n;i++)
		ans*=c[n-2-sum][d[i]],sum+=d[i];
	printf("%lld\n",ans);
}