Problem
You are given a binary matrix of size N x M (only 0s and 1s). Each row is sorted (all 0s come before 1s). Find the index of the row with the maximum number of 1s using pointers.
Input format
Input
input.txt
- First line: integers N and M (1 ≤ N, M ≤ 100) - Next N lines: each with M space-separated 0s or 1s
Output format
Output
output.txt
- Integer: index of the row with most 1s (0-based)
Example
input
3 4 0 0 1 1 0 1 1 1 0 0 0 1
output
1
💬 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 4 0 0 1 1 0 1 1 1 0 0 0 1
Expected output
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