Description: Pond, the n tablets lotus leaf (1 ≤ n ≤ 1000), they just form a convex polygon. These n piece lotus leaf sequential number according to the clockwise direction as 1,2, ..., n.
A little frog standing on a lotus leaf on the 1st, it would like to skip every piece of lotus leaf once and only once (it can jump from the station of the lotus leaf to any one on a lotus leaf). At the same time, it would like to skip the shortest total distance
To Search:
File list (Check if you may need any files):
新建 文本文档.txt
Download