Preparando MOJI

Set of Points

2000ms 262144K

Description:

Convexity of a set of points on the plane is the size of the largest subset of points that form a convex polygon. Your task is to build a set of n points with the convexity of exactly m. Your set of points should not contain three points that lie on a straight line.

Input:

The single line contains two integers n and m (3 ≤ m ≤ 100, m ≤ n ≤ 2m).

Output:

If there is no solution, print "-1". Otherwise, print n pairs of integers — the coordinates of points of any set with the convexity of m. The coordinates shouldn't exceed 108 in their absolute value.

Sample Input:

4 3

Sample Output:

0 0
3 0
0 3
1 1

Sample Input:

6 3

Sample Output:

-1

Sample Input:

6 6

Sample Output:

10 0
-10 0
10 1
9 1
9 -1
0 -2

Sample Input:

7 4

Sample Output:

176166 6377
709276 539564
654734 174109
910147 434207
790497 366519
606663 21061
859328 886001

Informação

Codeforces

Provedor Codeforces

Código CF277B

Tags

constructive algorithmsgeometry

Submetido 0

BOUA! 0

Taxa de BOUA's 0%

Datas 09/05/2023 08:42:18

Relacionados

Nada ainda