Preparando MOJI

Polygon

1000ms 262144K

Description:

Polycarpus loves convex polygons, especially if all their angles are the same and all their sides are different. Draw for him any such polygon with the given number of vertexes.

Input:

The input contains a single integer n (3 ≤ n ≤ 100) — the number of the polygon vertexes.

Output:

Print n lines, containing the coordinates of the vertexes of the n-gon "xi yi" in the counter clockwise order. The coordinates of the vertexes shouldn't exceed 106 in their absolute value. The side lengths should fit within limits [1, 1000] (not necessarily integer). Mutual comparing sides and angles of your polygon during the test will go with precision of 10 - 3.

If there is no solution, print "No solution" (without the quotes).

Sample Input:

8

Sample Output:

1.000 0.000
7.000 0.000
9.000 2.000
9.000 3.000
5.000 7.000
3.000 7.000
0.000 4.000
0.000 1.000

Informação

Codeforces

Provedor Codeforces

Código CF306D

Tags

constructive algorithmsgeometry

Submetido 0

BOUA! 0

Taxa de BOUA's 0%

Datas 09/05/2023 08:44:08

Relacionados

Nada ainda