nyoj-1103-区域赛系列一多边形划分

标签：style   blog   http   io   ar   color   os   sp   for   

http://acm.nyist.net/JudgeOnline/problem.php?pid=1103

描述

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

样例输入

3 3 4 5

样例输出

Case #1 : 1 Case #2 : 2 Case #3 : 5 

提示

Catalan number

解题思路： 卡特兰数

  1 #include <stdio.h>

nyoj-1103-区域赛系列一多边形划分

标签：style   blog   http   io   ar   color   os   sp   for   

原文地址：http://www.cnblogs.com/angle-qqs/p/4121836.html