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.（求矩陣A+B非零行和非零列數）

原始碼：

#include <iostream>
using namespace std;
int main()
{
	int M,N;
	int num,flag;
	int a[10][10],b[10][10];
	int sum[10][10];
	int i,j;	
	while(cin>>M>>N)
	{
		num=0,flag=0;
		if(M==0)
		{
			break;
		}
		else
		{
			for(i=0;i<M;i++)
			{
				for(j=0;j<N;j++)
				{
					cin>>a[i][j];
				}
			}
			for(i=0;i<M;i++)
			{
				for(j=0;j<N;j++)
				{
					cin>>b[i][j];
				}
			}
			for(i=0;i<M;i++)
			{
				for(j=0;j<N;j++)
				{
					sum[i][j]=a[i][j]+b[i][j];
				}
			}
			/*for(i=0;i<M;i++) //A+B
			{
				for(j=0;j<N;j++)
				{
					cout<<sum[i][j]<<" ";
				}
				cout<<endl;
			}*/
			for(i=0;i<M;i++)   //行遍歷
			{ 
				flag=0;
				for(j=0;j<N;j++)
				{
					if(sum[i][j]!=0)
					{
						flag++;
					}
				}
				if(flag==0)
				{
					num++;
				}
			}
			for(j=0;j<N;j++)   //列遍歷
			{ 
				flag=0;
				for(i=0;i<M;i++)
				{
					if(sum[i][j]!=0)
					{
						flag++;
					}
				}
				if(flag==0)
				{
					num++;
				}
			}
			cout<<num<<endl;
		}
	}
	return 0;
}