Previous Next
0 / 21
Module DEMO-32-109DEMO-C-32

Cinema Seating

DEMO-C-32 • Programming in C

Browser-only practice

Problem Statement

Given a binary matrix representing cinema seats (0=Empty, 1=Occupied), find the length of the longest consecutive sequence of empty seats (0s) in any single row.

Constraints

1 <= N, M <= 10. Integers within standard range.

Input Format

Input: Dimensions N M followed by the matrix elements.

Output Format

Output: The formatted result as specified.

Sample Testcases

Submit runs every public testcase in this browser. Results and code never leave this device.

Sample #1
Public sample
Input
6 8
1 1 0 0 0 0 0 1
1 0 1 1 0 1 1 0
0 1 0 1 0 0 0 0
0 1 1 1 1 0 0 1
0 0 0 0 1 0 1 0
0 0 0 0 0 1 0 1
Output
5
Explanation
Max sequence of zeros is 5.
Sample #2
Public sample
Input
7 3
0 1 1
0 1 0
1 1 0
0 0 0
1 0 1
0 1 0
1 1 1
Output
3
Explanation
Max sequence of zeros is 3.
Sample #3
Public sample
Input
5 8
1 1 1 1 1 1 1 0
0 1 0 1 0 1 1 1
0 0 0 0 1 1 1 1
1 1 0 1 0 1 0 0
1 1 0 0 1 1 1 0
Output
4
Explanation
Max sequence of zeros is 4.
Sample #4
Public sample
Input
8 5
0 1 0 1 0
1 1 1 0 1
0 0 0 0 1
0 1 0 0 1
1 0 0 1 1
1 0 0 0 0
1 0 1 0 1
1 1 0 1 1
Output
4
Explanation
Max sequence of zeros is 4.

Web terminal

C, C++, Java, and Python run locally in a browser VM. No worker or visualizer is used.

Saved in this browser
Editor settings