Problem
Given an N x M maze with obstacles (0=open, 1=wall), count the number of unique paths from top-left to bottom-right, moving only right or down, using recursion.
Input format
Input
input.txt
- First line: N M (2 ≤ N,M ≤ 10) - Next N lines: M integers (0 or 1)
Output format
Output
output.txt
- Number of unique paths
Example
input
3 3 0 0 0 0 1 0 0 0 0
output
2
💬 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 3 0 0 0 0 1 0 0 0 0
Expected output
2
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