本文介绍了卡特兰数及其在连接数字对问题中的应用，以及二叉搜索树的概念，探讨了如何计算不同大小的二叉搜索树的数量。同时，提出了一种涉及找零问题的组合数学问题，分析了不同条件下合法序列的计数方法。
卡特兰数链接 https://blog.csdn.net/ZCY19990813/article/details/81181505
Game of Connections
Description
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?
Input
Each line of the input file
订阅专栏 解锁全文
扫一扫
1564
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
