Game of Connections
-
描述
-
This is a small but ancient game. You are supposed to write downthe numbers 1, 2, 3, . . . , 2n - 1, 2n consecutively in clockwiseorder on the ground to form a circle, and then, to draw somestraight line segments to connect them into number pairs. Everynumber must be connected to exactly oneanother.
And, no two segments are allowed tointersect.
It's still a simple game, isn't it? But after you've written downthe 2n numbers, can you tell me in how many different ways can youconnect the numbers into pairs? Life is harder, right? -
-
输入
-
Each line of the input file will be a single positive number n,except the last line, which is a number -1.
You may assume that 1 <= n <=100.
输出
- For each n, print in a single line the number of ways to connectthe 2n numbers into pairs 样例输入
-
2 3 -1
样例输出
-
2 5
来源
- POJ
- 【链接来源】
-
http://blog.163.com/lz_666888/blog/static/114785726200991411292280
3/ - http://baike.baidu.com/view/2499752.htm
-
Catalan数
中文:卡特兰数
原理:
令h(1)=1,h(0)=1,catalan数满足递归式:
h(n)= h(1)*h(n-1) + h(2)*h(n-2) + ... + h(n-1)h(1)(其中n>=2)
另类递归式:
h(n)=((4*n-2)/(n+1))*h(n-1);
该递推关系的解为:
h(n+1)=C(2n,n)/(n+1) (n=1,2,3,...)
我并不关心其解是怎么求出来的,我只想知道怎么用catalan数分析问题。
我总结了一下,最典型的四类应用:(实质上却都一样,无非是递归等式的应用,就看你能不能分解问题写出递归式了)
1.括号化问题。
矩阵链乘:P=a1×a2×a3×……×an,依据乘法结合律,不改变其顺序,只用括号表示成对的乘积,试问有几种括号化的方案?(h(n)种)
2.出栈次序问题。
一个栈(无穷大)的进栈序列为1,2,3,..n,有多少个不同的出栈序列?
类似:有2n个人排成一行进入剧场。入场费5元。其中只有n个人有一张5元钞票,另外n人只有10元钞票,剧院无其它钞票,问有多少中方法使得只要有10元的人买票,售票处就有5元的钞票找零?(将持5元者到达视作将5元入栈,持10元者到达视作使栈中某5元出栈)
3.将多边行划分为三角形问题。
将一个凸多边形区域分成三角形区域的方法数?
类似:一位大城市的律师在她住所以北n个街区和以东n个街区处工作。每天她走2n个街区去上班。如果她
从不穿越(但可以碰到)从家到办公室的对角线,那么有多少条可能的道路?
类似:在圆上选择2n个点,将这些点成对连接起来使得所得到的n条线段不相交的方法数?
4.给顶节点组成二叉树的问题。
给定N个节点,能构成多少种不同的二叉树?
(能构成h(N)个)
Catalan数的解法
Catalan数的组合公式为 Cn=C(2n,n) / (n+1);
此数的递归公式为 h(n ) = h(n-1)*(4*n-2) / (n+1)
-
代码:
-
#include<iostream>
#include<cstdio>
using namespace std;
int a[101][101] = {0};
int main()
{
intn,i,j,len,r,temp,t;
intb[101];
a[1][0] = 1; // 低坐标存放大数的低位
len =1;
b[1] =1;
for (i = 2;i <= 100; i++)
{
t = i - 1;
for (j=0;j<len;j++) // 模拟乘法,从低位开始
{
a[i][j] = a[i-1][j] * (4 * t +2);
}
for (r = j = 0; j < len; j++) // 处理相乘结果
{
temp = a[i][j] + r;
a[i][j] = temp % 10;
r = temp / 10;
}
while (r) // 进位处理
{
a[i][len++] = r % 10;
r /= 10;
}
for (j = len-1, r = 0; j >= 0; j--) //模拟除法,从高位开始
{
temp = r * 10 + a[i][j];
a[i][j] = temp / (t+2);
r = temp % (t+2);
}
while (!a[i][len-1]) // 高位零处理
{
len--;
}
b[i] = len; // 记录结果的长度
}
while(cin>>n&&n!=-1)
{
for(j = b[n] - 1; j >= 0; j--)
{
printf("%d",a[n][j]);
}
printf("\n");
}
return0;
}
-
Each line of the input file will be a single positive number n,except the last line, which is a number -1.