九度OJ：1001

时间限制：1 秒

内存限制：32 兆

特殊判题：否

提交：16893

解决：6785

题目描述：

    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年浙江大学计算机及软件工程研究生机试真题

AC：

<span style="font-size:18px;">#include<iostream>
using namespace std;
int main()
{
 int n,m,i,j;
 int a[101],b[101];
 while (std::cin>>n,n!=0)
 {
	int count=0,flag;
  	std::cin>>m;
    for(i=0;i<n*m;i++)
    	std::cin>>a[i];
    for(i=0;i<n*m;i++)
    	std::cin>>b[i];
    for(i=0;i<n;i++)
    {
    	flag=0;
    	for(j=0;j<m;j++)
    	if(a[j+i*m]+b[j+i*m]!=0)
    	{
    		flag=1;
    	}
    	if(flag==0)
     	{
     		count++;
     	}
    }
    for(i=0;i<m;i++)
    {
    	flag=0;
    	for(j=0;j<n;j++)
    	if(a[i+j*m]+b[i+j*m]!=0)
        {
        	flag=1;
        }
    	if(flag==0)
     	{
     		count++;
     	}
    }
      std::cout<<count<<std::endl;
 }
	return 0;
}</span>