k-combinations from {1..n} MEDIUM Backtracking (BAC) 25 XP 0 solved
Mobile coding works. A laptop is faster for long sessions.

Problem

Read two positive natural numbers `n` and `k` (`k <= n`). Generate and print, in lexicographic order, all subsets of exactly `k` elements of the set `{1, 2, ..., n}`.

Input format

Input input.txt

The program reads from standard input two natural numbers, `n` and `k`, separated by a space. - `1 <= k <= n <= 8`

Output format

Output output.txt

The program prints all combinations, one per line. On each line the elements are written in strictly ascending order, separated by spaces, with no trailing space. Combinations must be printed in lexicographic order.

Example

input
4 2
output
1 2

1 3

1 4

2 3

2 4

3 4

Ready to solve this challenge?

Create a free account to write code, submit solutions, and track your progress.

⌨️ Keyboard Shortcuts

Code Editor
Run Code
Ctrl Enter
Submit Code
Ctrl Shift Enter
Format Code
Shift Alt F
Toggle Comment
Ctrl /
Undo
Ctrl Z
Redo
Ctrl Y
Navigation
Global Search
/
Show Shortcuts
?
Close Modal
Esc

🔍 Interactive Debugger

0 / 0

Analyzing your code...

📦 Variables

No variables yet

📚 Call Stack
main() line 1
📤 Output
We use cookies

Essential cookies are always active. You can choose to enable preference and analytics cookies. Learn more