题目1001：A+B for Matrices

题目描述：

    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

来源：

2011年浙江大学计算机及软件工程研究生机试真题

using namespace std;
int main()
{
	int M,N,i,j,count;
	int a[10][10],b[10][10],c[10][10];

	while((cin>>M>>N)&&M!=0)
	{
		count=0;
		//矩阵A
		for(i=0;i<M;i++)
		{
			for(j=0;j<N;j++)
			{
				cin>>a[i][j];
			}
		}
		//矩阵B，C=A+B
		for(i=0;i<M;i++)
		{
			for(j=0;j<N;j++)
			{
				cin>>b[i][j];
				c[i][j]=a[i][j]+b[i][j];
			}
		}
		//求矩阵为0的行数
		for(i=0;i<M;i++)
		{
			j=0;
			while(j<N&&c[i][j]==0)
			{
				j++;
			}
			if(j==N)
				count++;
		}
		//求矩阵为0的列数
		for(j=0;j<N;j++)
		{
			i=0;
			while(i<M&&c[i][j]==0)
			{
				i++;
			}
			if(i==M)
				count++;
		}
		//输出行数和列数为0的总数
		cout<<count<<endl;

	}
	return 0;
}