Problem
Given two integers N and R (0 ≤ R ≤ N ≤ 10), print all combinations of size R from numbers 1 to N in lexicographic order using recursion, one per line (elements separated by space).
Input format
Input
input.txt
- Two integers N and R
Output format
Output
output.txt
- Each combination on a line (space-separated), or nothing if R=0
Example
input
4 2
output
1 2 1 3 1 4 2 3 2 4 3 4
💬 Discussion
Loading...💬
No comments yet. Be the first to start the discussion!
💻 No output yet.
Click Run in the editor to execute your code with the custom input.
Sample cases (from the problem)
Sample Case 1
Input
4 2
Expected output
1 2 1 3 1 4 2 3 2 4 3 4
Solve it your way first
Community solutions unlock after you submit a passing solution. Don't peek.
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