{"trustable":false,"prependHtml":"\u003cstyle type\u003d\"text/css\"\u003e\n #problem-body \u003e pre {\n display: block;\n padding: 9.5px;\n margin: 0 0 10px;\n font-size: 13px;\n line-height: 1.42857143;\n word-break: break-all;\n word-wrap: break-word;\n color: #333;\n background: rgba(255, 255, 255, 0.5);\n border: 1px solid #ccc;\n border-radius: 6px;\n }\n\u003c/style\u003e\n","sections":[{"title":"","value":{"format":"HTML","content":"\u003chtml\u003e\n \u003chead\u003e\u003c/head\u003e\n \u003cbody\u003e\n \u003cdiv id\u003d\"problem-body\"\u003e \n \u003cp\u003e给出一个凸n边形,求用n-3条不相交的对角线将该n边形划分为三角形的方案数\u003c/p\u003e \n \u003cp\u003e\u0026nbsp;\u003c/p\u003e \n \u003ch3\u003eInput\u003c/h3\u003e \n \u003cp\u003eFirst line of the input will be an integer t (1\u0026lt;\u003dt\u0026lt;\u003d100000) which is the no of test cases. Each test case contains a single integer n (3\u0026lt;\u003dn\u0026lt;\u003d1000) which is the size of the polygon.\u003c/p\u003e \n \u003ch3\u003eOutput\u003c/h3\u003e \n \u003cp\u003eFor each test case output the no of ways %100007.\u003c/p\u003e \n \u003ch3\u003eExample\u003c/h3\u003e \n \u003cpre\u003e\u003cstrong\u003eInput:\u003c/strong\u003e\n2\u003cbr\u003e3\u003cbr\u003e5\u003cbr\u003e\u003cbr\u003e\u0026nbsp;\u003cstrong\u003eOutput:\u003c/strong\u003e\n1\u003cbr\u003e5\u003c/pre\u003e \n \u003c/div\u003e\n \u003c/body\u003e\n\u003c/html\u003e"}}]}