当前你的浏览器版本过低,网站已在兼容模式下运行,兼容模式仅提供最小功能支持,网站样式可能显示不正常。
请尽快升级浏览器以体验网站在线编辑、在线运行等功能。

建议使用的浏览器:

谷歌Chrome 火狐Firefox Opera浏览器 微软Edge浏览器 QQ浏览器 360浏览器 傲游浏览器

2084:Game of Connections

题目描述
This is a small but ancient game. You are supposed to write down the numbers 1, 2, 3, . . . , 2n - 1, 2n consecutively in clockwise order on the ground to form a circle, and then, to draw some straight line segments to connect them into number pairs. Every number must be connected to exactly one another.
And, no two segments are allowed to intersect.
It's still a simple game, isn't it? But after you've written down the 2n numbers, can you tell me in how many different ways can you connect 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 connect the 2n numbers into pairs.
输入样例
2
3
-1
输出样例
2
5

该题目是Virtual Judge题目,来自 北京大学POJ

源链接: POJ-2084

最后修改于 2020-10-29T06:22:54+00:00 由爬虫自动更新

共提交 0

通过率 --%
时间上限 内存上限
1000 30000