区域赛系列一多边形划分
-
描述
-
Give you a convex(凸边形), diagonal n-3 disjoint divided into n-2 triangles(直线), for different number of methods, such as n=5, there are 5 kinds of partition method, as shown in Figure
-
输入
-
The first line of the input is a n (1<=n<=1000), expressed n data set.
The next n lines each behavior an integer m (3<=m<=18), namely the convex edges.
输出
-
For each give m,, output how many classification methods.
example output: Case #a : b
样例输入
-
3345
样例输出
-
Case #1 : 1Case #2 : 2Case #3 : 5
提示
- Catalan number 来源
- 原创 上传者
卡特兰数:
卡塔兰数是组合数学中一个常出现在各种计数问题中出现的数列。由以比利时的数学家欧仁·查理·卡塔兰 (1814–1894)命名。
卡塔兰数的一般项公式为 另类递归式: h(n)=((4*n-2)/(n+1))*h(n-1);
前几项为 (OEIS中的数列A000108): 1, 1, 2, 5, 14, 42, 132, 429, 1430, 4862, 16796, 58786, 208012, 742900, 2674440, 9694845, 35357670, 129644790, 477638700, 1767263190, 6564120420, 24466267020, 91482563640, 343059613650, 1289904147324, 4861946401452, ...
令h(0)=1,h(1)=1,catalan数满足递归式:
h(n)= h(0)*h(n-1) + h(1)*h(n-2) + + h(n-1)h(0) (其中n>=2)另类递归式: h(n)=((4*n-2)/(n+1))*h(n-1);
#include<stdio.h> int main(){ int n,k; k=0; scanf("%d",&n); while(n--) { int m; double a[20]={1,1,2},s; scanf("%d",&m); int x=m-2; for(int i=2;i<=x;i++) { //a[i]=((4*i-2)/(i+1)*1.0)*a[i-1]; 为什么用这一句就不行了? s=(4*i-2)/((i+1)*1.0); a[i]=s*a[i-1]; } printf("Case #%d : %.0f\n",++k,a[x]); } return 0; }
-
The first line of the input is a n (1<=n<=1000), expressed n data set.