The Triangle Division of the Convex Polygon

The Triangle Division of the Convex Polygon

Time Limit: 1000ms, Special Time Limit:2500ms, Memory Limit:65536KB

Total submit users: 28, Accepted users: 17

Problem 11562 : No special judgement

Problem description

A convex polygon with n edges can be divided into several triangles by some non-intersect diagonals. We denote d(n) is the number of the different ways to divide the convex polygon. For example,when n is 6,there are 14 different ways.Figure 1 shows such 14 ways. Then ,we get d(6)=14.  Figure 1 when n=6, d(6)=14 . Your task is that:for a given integer n, you’d tel