Problem of the day
The value of M[i][j] should be 1.
All other cells of row i should be 0.
All other cells of column j should be 0.
For the matrix :
1 0 0
0 0 0
0 1 0
The Answer will be 2 as cell (0,0) and (2,1) are special.(Indexing is 0 based).
The first line of the input contains an integer, 'T,’ denoting the number of test cases.
The first line of each test case contains two integers,' N’ and ‘M’ denoting the number of rows and columns.
The next line of each test case has ‘N’ lines that have M values corresponding to the matrix ‘MAT’.
For each test case, print an integer corresponding to the number of special cells in the matrix.
Print the output of each test case in a separate line.
You do not need to print anything. It has already been taken care of. Just implement the given function.
1 <= T <= 10
1 <= N <= 1000.
1 <= M <= 1000.
Time limit: 1 sec
2
3 3
1 0 0
0 0 0
0 1 0
4 3
1 0 0
0 0 1
0 0 0
0 1 1
2
1
For the first test case,
There are two special cells having index (0,0) and (2,1).Hence, the answer is 2.
For the second test case:
There is only one cell that is special having an index (0,0). Hence, the answer is 1.
Hence the answer is 3.
2
4 4
0 1 0 0
0 0 0 0
0 0 0 0
0 0 0 1
4 3
0 1 0
0 0 1
0 1 0
0 0 0
2
1