CF277B.Set of Points

普及/提高-

通过率：0%

AC君温馨提醒

该题目为【codeforces】题库的题目，您提交的代码将被提交至codeforces进行远程评测，并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供，我们无法保证该服务的稳定性，若提交后无反应，请等待一段时间后再进行重试。

题目描述

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.

输入格式

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

输出格式

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 $10^{8}$ in their absolute value.

输入输出样例

输入#1
```
4 3
```
输出#1
```
0 0
3 0
0 3
1 1
```
输入#2
```
6 3
```
输出#2
```
-1
```
输入#3
```
6 6
```
输出#3
```
10 0
-10 0
10 1
9 1
9 -1
0 -2
```

输入#4

7 4

输出#4

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

首页