题目大意:n个点组成的联通图有多少种。
思路:动态规划的思想。设f[i]为i个点的连通图有多少种。显然f[1] = 1。
从2个点开始,我们用所有的方案 - 不连通的图的方案。
所有的方案很简单,2^(n * (n - 1))。
然后我们枚举哪些点与1号节点联通,剩下的点不与1号节点联通,那么图就是不连通的。
设有k个节点与1号节点联通,那么这个方案数是f[k + 1]。剩下的点随便连,方案是2 ^ ((n - k - 1) * (n - k - 2))。把这两个乘起来。
总递推方程:f[i] = 2^(n * (n - 1)) - Σ(f[k + 1] * C[n - 1,k] * 2^((n - k - 1) * (n - k - 2))){k < n - 1 && k >= 0};
然后就是无脑的高精度。
CODE:
<span style="font-family:Arial;">#define _CRT_SECURE_NO_WARNINGS
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <algorithm>
#define MAX 1010
#define BASE 1000
using namespace std;
struct BigInt{
int num[MAX],len;
BigInt(int _ = 0) {
memset(num,0,sizeof(num));
num[len = 1] = _;
}
BigInt operator +(const BigInt &a)const {
BigInt re;
re.len = max(len,a.len);
int temp = 0;
for(int i = 1; i <= re.len; ++i) {
re.num[i] = num[i] + a.num[i] + temp;
temp = re.num[i] / BASE;
re.num[i] %= BASE;
}
if(temp) re.num[++re.len] = temp;
return re;
}
BigInt operator -(const BigInt &a)const {
BigInt re;
re.len = max(len,a.len);
bool temp = false;
for(int i = 1; i <= re.len; ++i) {
re.num[i] = num[i] - a.num[i] - temp;
if(re.num[i] < 0) re.num[i] += BASE,temp = true;
else temp = false;
}
while(!re.num[re.len]) --re.len;
return re;
}
BigInt operator *(const BigInt &a)const {
BigInt re;
re.len = len + a.len;
for(int i = 1; i <= len; ++i)
for(int j = 1; j <= a.len; ++j) {
re.num[i + j - 1] += num[i] * a.num[j];
re.num[i + j] += re.num[i + j - 1] / BASE;
re.num[i + j - 1] %= BASE;
}
while(!re.num[re.len]) --re.len;
return re;
}
}f[MAX];
ostream &operator <<(ostream &os,const BigInt &a)
{
os << a.num[a.len];
for(int i = a.len - 1; i; --i)
os << fixed << setfill('0') << setw(3) << a.num[i];
return os;
}
BigInt Get2PowerK(int k)
{
BigInt re(1);
for(int i = 1; i <= k; ++i)
re = re * BigInt(2);
return re;
}
int factor[MAX];
inline void Fix(int x,int c)
{
for(int i = 2; i * i <= x; ++i)
if(x % i == 0)
while(x % i == 0){
x /= i;
factor[i] += c;
}
if(x != 1) factor[x] += c;
}
BigInt C(int m,int n)
{
memset(factor,0,sizeof(factor));
for(int i = 1; i <= m; ++i)
Fix(i,1);
for(int i = 1; i <= n; ++i)
Fix(i,-1);
for(int i = 1; i <= m - n; ++i)
Fix(i,-1);
BigInt re(1);
for(int i = 2; i < MAX; ++i)
for(int j = 1; j <= factor[i]; ++j)
re = re * BigInt(i);
return re;
}
int main()
{
f[1] = BigInt(1);
for(int i = 2; i <= 50; ++i) {
BigInt temp;
for(int k = 0; k < i; ++k)
temp = temp + f[k + 1] * C(i - 1,k) * Get2PowerK((i - k - 1) * (i - k - 2) / 2);
f[i] = Get2PowerK(i * (i - 1) / 2) - temp;
}
int x;
while(scanf("%d",&x),x)
cout << f[x] << endl;
return 0;
}</span>