← 返回题目

题库练习 Diverse Permutation

← 上一题下一题 →

A9765 | $Diverse Permutation$

时间限制1s

内存限制256MB

通过 / 提交0/0

题目描述

Permutation $p$ is an ordered set of integers $p_{1},p_{2},...,p_{n}$ , consisting of $n$ distinct positive integers not larger than $n$ . We'll denote as $n$ the length of permutation $p_{1},p_{2},...,p_{n}$ . Your task is to find such permutation $p$ of length $n$ , that the group of numbers $|p_{1}-p_{2}|,|p_{2}-p_{3}|,...,|p_{n-1}-p_{n}|$ has exactly $k$ distinct elements.

输入格式

The single line of the input contains two space-separated positive integers $n$ , $k$ ( $1<=k<n<=10^{5}$ ).

输出格式

Print $n$ integers forming the permutation. If there are multiple answers, print any of them.

输入输出样例

输入 #1

3 2

输出 #1

1 3 2

输入 #2

3 1

输出 #2

1 2 3

输入 #3

5 2

输出 #3

1 3 2 4 5

C++ 编辑器

输入

输出