The city of Matrix is tricky. You are given a n*n binary matrix map of

1.	The city of Matrix is tricky. You are given a n*n binary matrix map of the city. You will get life points if the submatrix you decide to work on has a single 1. Given the map find the number of submatrices that will give you life points. The submatrices are not essentially square matrices. Input: The first line contains the value of n. Next, the matrix is entered row-by-row, each row input in a new line. Output: The number of submatrices.
Answer» ANSWER: SORRY I Didn't understand what's your QUESTION Explanation: please resend it

The city of Matrix is tricky. You are given a n*n binary matrix map of the city. You will get life points if the submatrix you decide to work on has a single 1. Given the map find the number of submatrices that will give you life points. The submatrices are not essentially square matrices. Input: The first line contains the value of n. Next, the matrix is entered row-by-row, each row input in a new line. Output: The number of submatrices.

Answer»

SORRY I Didn't understand what's your QUESTION

Explanation:

please resend it