Problem
Given an N x M matrix (2 ≤ N,M ≤ 10) of 0s and 1s, count the number of islands using recursion. An island is a group of 1s connected horizontally, vertically, or diagonally.
Input format
Input
input.txt
- The first line contains two integers N and M - The next N lines each contain M integers (0 or 1)
Output format
Output
output.txt
- The number of islands
Example
input
3 3 1 1 0 0 1 0 1 0 1
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 1 1 0 0 1 0 1 0 1
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