ACM_卡特兰数
LzyRapX
Just For Fun .
展开
-
Catalan数
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原创 2016-10-23 00:04:09 · 486 阅读 · 0 评论 -
HDU 1134 Game of Connections (高精度卡特兰数)
Game of Connections Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 4263 Accepted Submission(s): 2480 Problem Description This is a sm原创 2016-10-23 00:13:04 · 844 阅读 · 0 评论