301618: CF306D. Polygon

Memory Limit:256 MB Time Limit:1 S
Judge Style:Text Compare Creator:
Submit:0 Solved:0

Description

Polygon

题意翻译

给定 n,要你画一个 n 个点的凸多边形,满足每个角角度相同,每条边长度不同。如果无解输出无解,否则输出一个合法凸多边形。 边长长度应该在 [1, 1000] 内。坐标允许实数。坐标绝对值要求不超过$10^6$ 要求的精度是 $10^{−3}$。 Translated by Fowany

题目描述

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.

输入输出格式

输入格式


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

输出格式


Print $ n $ lines, containing the coordinates of the vertexes of the $ n $ -gon " $ x_{i} $ $ y_{i} $ " in the counter clockwise order. The coordinates of the vertexes shouldn't exceed $ 10^{6} $ 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).

输入输出样例

输入样例 #1

8

输出样例 #1

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

Input

题意翻译

给定 n,要你画一个 n 个点的凸多边形,满足每个角角度相同,每条边长度不同。如果无解输出无解,否则输出一个合法凸多边形。 边长长度应该在 [1, 1000] 内。坐标允许实数。坐标绝对值要求不超过$10^6$ 要求的精度是 $10^{−3}$。 Translated by Fowany

加入题单

算法标签: