Given a N x N binary matrix A where each row and column of the matrix is sorted in ascending order , Your task is to complete the function **countZero** which returns the count of number of 0s present in it.

**Note : **Elements in matrix can be either 1 or 0

**Input:**

The first line of input will be the no of test cases then T test cases will follow . The second line of each test case contains two space separated integers M,N denoting the size of the 2 d matrix . Then in the next lines are the space separated values of the matrix A[ ] [ ] .

**Output:**

The output will be the number of zeroes present in the square matrix.

**Constraints:**

1<=T<=50

1<=M,N<=50

0<=A[][]<=1

**Example:
Input**

1

3

0 0 0 0 0 1 0 1 1

6

Author: Shubham Joshi 1

If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.

mantan_g | 267 |

tushki | 198 |

aksht7 | 182 |

ayush1101 | 128 |

namansharmacse17 | 110 |

ARUN_PUNDIR | 730 |

manishgupta8497 | 627 |

AMAN__JAIN | 625 |

Abhimanyu_kumar | 562 |

AJ786 | 541 |

blackshadows | 5335 |

Ibrahim Nash | 5223 |

akhayrutdinov | 5111 |

mb1973 | 4929 |

Quandray | 4584 |

Login to report an issue on this page.