Read a positive natural number n. Generate and print in lexicographic
order all binary strings (composed only of the digits 0 and 1) of
length n that contain no two consecutive 1 digits.
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 <= 10`
Output format
Output
output.txt
The program prints all strings that satisfy the condition, one per line, in lexicographic order (with `0` before `1`). The digits of each string are printed with no spaces between them.
Example
input
3
output
000 001 010 100 101
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
000 001 010 100 101
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