Read a positive natural number n. Generate and print, in lexicographic
order, all permutations of the set {1, 2, ..., n}.
Mobile coding works. A laptop is faster for long sessions.
Problem
Input format
Input
input.txt
The program reads from standard input a single natural number, `n`. - `1 <= n <= 7`
Output format
Output
output.txt
The program prints to standard output all permutations of `{1, 2, ..., n}`, one per line. On each line, the values are separated by spaces with no trailing space. Permutations must be printed in lexicographic order (the first element has priority; ties are broken by comparing the second element, and so on).
Example
input
3
output
1 2 3 1 3 2 2 1 3 2 3 1 3 1 2 3 2 1
Stuck?
Use the Get Hint button in the action bar to reveal a guided hint.
💬 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
3
Expected output
1 2 3 1 3 2 2 1 3 2 3 1 3 1 2 3 2 1
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