This time, you are supposed to find A+B where A and B are two matrices, and then count the number of zero rows and columns.

    The input consists of several test cases, each starts with a pair of positive integers M and N (≤10) which are the number of rows and columns of the matrices, respectively. Then 2*M lines follow, each contains N integers in [-100, 100], separated by a space. The first M lines correspond to the elements of A and the second M lines to that of B.

    The input is terminated by a zero M and that case must NOT be processed.

    For each test case you should output in one line the total number of zero rows and columns of A+B.

2 2
1 1
1 1
-1 -1
10 9
2 3
1 2 3
4 5 6
-1 -2 -3
-4 -5 -6
0

1

5

My answer:

#include<iostream>
using namespace std;
int main(){
	int M,N,sum;
	while(1){
		cin>>M;
		if(M==0) break;
		cin>>N;
		int count=0;
		int a[M][N],b[M][N],c[M][N];
		if(M<=10&&N<=10){
			for(int i=0;i<M;i++)
				for(int j=0;j<N;j++){
					cin>> a[i][j];
				}
	  		for(int i=0;i<M;i++)
				for(int j=0;j<N;j++){
					cin>> b[i][j];
				}	
			for(int i=0;i<M;i++)
				for(int j=0;j<N;j++){
					c[i][j]=a[i][j]+b[i][j];
				}
		}
		for(int i=0;i<M;i++){
		    sum=0;
			for(int j=0;j<N;j++){
				sum+=c[i][j];
			}
			if(sum==0)
				count++;
		}
		for(int i=0;i<N;i++){
	     	sum=0;
			for(int j=0;j<M;j++){
				sum+=c[j][i];
			}
			if(sum==0)
				count++;
		}	
		cout<<count<<'\n';	
	}
	return 0;
}