The given code reads two integers: n, m, then reads nxm integers into 2-D integer array: table. Find and print the size of the longest vertical line of zeros.
Examples:
3 3
0 0 0
0 2 0
0 0 3
|
3 |
4 5
0 1 0 3 0
1 0 2 0 5
0 1 0 3 0
1 0 2 0 5
|
1 |
6 5
8 1 8 3 8
8 1 8 3 8
8 1 8 3 8
8 1 8 3 8
8 1 8 3 8
8 1 8 3 8
|
0 |
2 2
0 0
0 0
|
2 |
6 5
8 1 8 3 8
8 0 0 0 8
8 1 0 0 8
8 1 0 0 8
8 1 8 0 8
8 1 8 0 8
|
5 |
Important issues about all exams/projects/quizzes:
- Update just Question.c file, not Question.txt.
- Make changes only between the following comments(DO NOT modify these comments or anything outside the region marked by the comments):
- // DO_NOT_EDIT_ANYTHING_ABOVE_THIS_LINE
- // DO_NOT_EDIT_ANYTHING_BELOW_THIS_LINE
- If you modify these comments for any reason, you can copy/paste the initial version from Question.txt into Question.c. Note that Question.txt is not graded at all, so anything you write in Question.txt will be discarded.
- To avoid getting the 'Binary Not Found' error, SAVE and BUILD your code before RUN.
- Do not add any extra messages message for input/output such as 'Enter an integer:', 'The result is:', etc. Any additional text that appears in the output will cause you to get no points from the question.
- Input and output of your program must be just like those in the Examples table above.