No.234 Meguru Meguru (4)
タグ : / 解いたユーザー数 19
作問者 :
LayCurse
Problem Statement
Charo, Senpai.
Right now, Meguru is playing a doujin game called Chota Quest, but the extra dungeon you get after clearing it is awful...
The story is that, to cure a friend's illness, you ask an adorable character named cucumber to make you a magical girl, and then you complete assignments, but these assignments are such a pain!
Floor $N$ of the Labyrinth of Assignments is shaped like it's made of a triangle with $N$ tiers, but... saying that doesn't really tell you anything, does it?
Drawn simply, it looks like this.
On floor $N$ of this labyrinth, if you walk along the designated route, the stairs to the next floor appear, but there are no hints at all about what the designated route is, so you have to try every single one...
Judging from the pattern so far, the designated route is a route that forms a simple polygon, but even so, there are just too many routes...
Oh, a simple polygon is a polygon whose edges don't cross. If you look at ARC037D, I think even you will get it, Senpai!
Ahh, jeez, just how many routes do I have to try...!?
Input
$N$
$1 \leq N \leq 12$
Output
Please output the number of routes on floor $N$, Senpai!
A route can start anywhere as long as it comes back to where it started, so it's the same as the number of simple polygons.
Sample
Sample 1
Input
1
Output
1
Sample 2
Sample 3
Input
5
Output
128967
提出するには、Twitter 、GitHub、 Googleもしくは右上の雲マークをクリックしてアカウントを作成してください。