1182. Convex Polygon division, 1182 Division

1182. Convex Polygon division, 1182 Division

In a convex n-edge shape, the question describes how many splitting schemes can be used to split n-edge shapes into several triangles through the diagonal lines that do not intersect in the n-edge shape.
For example, Pentagon has the following five sharding schemes.
Enter an integer n (3 <=n <= 32) in the first line ). Output a number to indicate the total number of partitioning schemes. Sample Input

5

Sample output

5

Data range: 3 <= n <= 32

1 # include <iostream> 2 using namespace std; 3 long int f [1001]; 4 int main () 5 {6 int n; 7 f [2] = 1; 8 f [3] = 1; 9 cin> n; 10 // n = n + 2; 11 for (int I = 4; I <= n; I ++) 12 {13 for (int j = 2; j <= n-1; j ++) 14 {15 f [I] = f [j] * f [I-j + 1] + f [I]; 16} 17} 18 cout <f [n]; 19 return 0; 20}