Given a regular polygon, there are numerous ways to divide it into several triangles and/or quadrangles by adding some diagonals that do not properly intersect each other. For example, Figure 4 shows all ten different divisions of a regular pentagon into triangles and quadrangles.
Figure 4: Divisions of a regular pentagon into triangles and quadrangles
Given n, the number of sides of the polygon, compute the number of such divisions.
输入描述
The input contains multiple test cases. Each test case consists of a single integer n (3 ≤ n ≤ 5000) on a separate line. The input ends where EOF is met.
输出描述
For each test case, print the answer modulo 264 on a separate line.
程序源码
完整的源代码:http://www.manonggu.com/suancheng/view7477.html
转载于:https://blog.51cto.com/12023575/1852312