当前你的浏览器版本过低,网站已在兼容模式下运行,兼容模式仅提供最小功能支持,网站样式可能显示不正常。
请尽快升级浏览器以体验网站在线编辑、在线运行等功能。
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.
3 4 5 6 7 8 9 10
1 3 10 38 154 654 2871 12925
时间上限 | 内存上限 |
2000 | 131072 |