将 $\{a, b, c, \dots\}$（前 $n$ 个小写英文字母）中所有大小不超过 $k$ 的非空子集分配到尽可能少的组中，需满足以下条件：
仅一行，包含两个整数 $n$ 和 $k$ ($1 \le k \le n \le 17$)。
输出最少的组数 $g$，随后输出 $g$ 个组的描述。 第 $i$ 个组的描述必须包含一个整数 $s_i$，随后是 $s_i$ 个子集的描述。每个子集的描述必须是一个包含子集元素的字符串，元素顺序不限，且不含空格。
3 2
5 1 ab 1 ac 1 bc 1 b 2 c a
3 3
4 1 abc 2 ab c 2 ac b 2 bc a
| ID | Type | Status | Title | Posted By | Last Updated | Actions |
|---|---|---|---|---|---|---|
| Editorial | Open | Official Editorial | Qingyu | - | Download |
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: