101654: [AtCoder]ABC165 E - Rotation Matching

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

Description

Score : $500$ points

Problem Statement

You are going to hold a competition of one-to-one game called AtCoder Janken. (Janken is the Japanese name for Rock-paper-scissors.) $N$ players will participate in this competition, and they are given distinct integers from $1$ through $N$. The arena has $M$ playing fields for two players. You need to assign each playing field two distinct integers between $1$ and $N$ (inclusive). You cannot assign the same integer to multiple playing fields. The competition consists of $N$ rounds, each of which proceeds as follows:

  • For each player, if there is a playing field that is assigned the player's integer, the player goes to that field and fight the other player who comes there.
  • Then, each player adds $1$ to its integer. If it becomes $N+1$, change it to $1$.

You want to ensure that no player fights the same opponent more than once during the $N$ rounds. Print an assignment of integers to the playing fields satisfying this condition. It can be proved that such an assignment always exists under the constraints given.

Constraints

  • $1 \leq M$
  • $M \times 2 +1 \leq N \leq 200000$

Input

Input is given from Standard Input in the following format:

$N$ $M$

Output

Print $M$ lines in the format below. The $i$-th line should contain the two integers $a_i$ and $b_i$ assigned to the $i$-th playing field.

$a_1$ $b_1$
$a_2$ $b_2$
$:$
$a_M$ $b_M$

Sample Input 1

4 1

Sample Output 1

2 3

Let us call the four players A, B, C, and D, and assume that they are initially given the integers $1$, $2$, $3$, and $4$, respectively.

  • The $1$-st round is fought by B and C, who has the integers $2$ and $3$, respectively. After this round, A, B, C, and D have the integers $2$, $3$, $4$, and $1$, respectively.

  • The $2$-nd round is fought by A and B, who has the integers $2$ and $3$, respectively. After this round, A, B, C, and D have the integers $3$, $4$, $1$, and $2$, respectively.

  • The $3$-rd round is fought by D and A, who has the integers $2$ and $3$, respectively. After this round, A, B, C, and D have the integers $4$, $1$, $2$, and $3$, respectively.

  • The $4$-th round is fought by C and D, who has the integers $2$ and $3$, respectively. After this round, A, B, C, and D have the integers $1$, $2$, $3$, and $4$, respectively.

No player fights the same opponent more than once during the four rounds, so this solution will be accepted.


Sample Input 2

7 3

Sample Output 2

1 6
2 5
3 4

Input

题意翻译

你将举行一场1v1竞技比赛Atcoser Janken。 $N$ 个初始编号为 $1-N$ 选手将会参加比赛。你只有 $M$ 个比赛场,所以你需要分派给每一个场地两个选手编号。当然,你~~为了做干净的比(ao)赛~~不能分派一个选手编号给多个比赛场地。比赛共有 $N$ 轮,每一轮流程如下: * 对于每一名选手,如果他的编号已经被分配了比赛场地,他将会去与对手对决。 * 然后每一名选手的编号 $+1$,如果编号变成了 $N+1$ ,那么将它变为 $1$ 。 (**即选手的编号会变化,而比赛场对决的选手的编号,每一轮都一样。**) 你希望在 $N$ 轮中没有选手与同一名选手对决多次。将编号分配方案输出。数据保证有解。

加入题单

上一题 下一题 算法标签: