考虑从 $1$ 到 $n$ 的所有整数集合。将这些整数分成 $k$ 个大小相等的组，使得所有组中整数之和的最大值与最小值之差最小。形式化地，如果 $s_i$ 是第 $i$ 组中整数的和，则应最小化以下值： $$\max_{i=1}^k s_i - \min_{i=1}^k s_i$$
第一行包含两个整数 $n$ 和 $k$ ($1 \le n, k \le 100\,000$；$n$ 能被 $k$ 整除)。
对于每一组，输出一行，包含该组中所有的整数。如果存在多个最优解，输出其中任意一个即可。
6 2
1 4 5 2 3 6
12 3
1 7 12 6 10 3 9 4 5 2 8 11
The discussion section is only for posting: General Discussions (problem-solving strategies, alternative approaches), and Off-topic conversations.
This is NOT for reporting issues! If you want to report bugs or errors, please use the Issues section below.
If you find any issues with the problem (statement, scoring, time/memory limits, test cases, etc.), you may submit an issue here. A problem moderator will review your issue.
Guidelines: