1.题目链接。这里面细节挺多的,首先公式是:(n-2)!/(d1-1)!/(d2-1)!....其中d是每个点的度数。至于怎么得到的,是根据无根树的Prufer序得到的,不懂得可以自行学习,挺简单的。就是一种把无根树映射到唯一的一个序列,有一种拓扑排序的思想,但是这个序列对于一个确定的无根树是唯一的,就像身份证号一样。知道了这些,在在计算组合数的时候,还是要处理一下,采用质因子分解计算。
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#pragma warning(disable:4996)
const int MAXN = 300;
int n;
ll d[MAXN], prime[MAXN];
int s[MAXN];
void getPrime()
{
memset(prime, 0, sizeof(prime));
for (int i = 2; i <= MAXN; i++)
{
if (!prime[i])prime[++prime[0]] = i;
for (int j = 1; j <= prime[0] && prime[j] * i <= MAXN; j++)
{
prime[prime[j] * i] = 1;
if (i % prime[j] == 0) break;
}
}
}
ll qpow(ll a, ll b)
{
if (b == 0)return 1;
ll res = 1;
while (b)
{
if (b)res = res * a;
a = a * a;
b >>= 1;
}
return res;
}
int main()
{
getPrime();
scanf("%d", &n);
int sum = 0;
for (int i = 1; i <= n; i++) { scanf("%d", &d[i]); sum += d[i]; }
if (n == 1 && d[1] != 0) { printf("0\n"); return 0; }
if (n > 1)for (int i = 1; i <= n; i++) { if (d[i] == 0) { printf("0\n"); return 0; } }
if (sum - n != n - 2) { printf("0\n"); return 0; }
memset(s, 0, sizeof(s));
for (int i = 1; i <= n - 2; i++)
{
int x = i;
for (int j = 1; j <= prime[0]; j++)
{
while (x % prime[j] == 0 && x != 0)
{
s[j]++;
x /= prime[j];
}
}
}
for (int i = 1; i <= n; i++)
{
for (int k = 1; k <= d[i] - 1; k++)
{
int x = k;
for (int j = 1; j <= prime[0]; j++)
{
while (x % prime[j] == 0 && x != 0)
{
s[j]--;
x /= prime[j];
}
}
}
}
ll ans = 1;
for (int i = 1; i <= 150; i++)
{
// cout << prime[i] << " " << s[i] << endl;
ans *= qpow(prime[i], s[i]);
}
printf("%lld\n", ans);
return 0;
}