九度 题目1001：A+B for Matrices

题目1001：A+B for Matrices

时间限制：1 秒

内存限制：32 兆

特殊判题：否

提交：6286

解决：2657

题目描述：

    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
       
       

      
      

#include <stdio.h>
#include <stdlib.h>
 
int main()
{
    int a[10][10],b[10][10];
    int m,n,i,j,count;
    bool zero;
    while(scanf("%d",&m),m)
    {
        scanf("%d",&n);
        count=0;
        for(i=0; i<m; i++)
            for(j=0; j<n; j++)
                scanf("%d",&a[i][j]);
        for(i=0; i<m; i++)
        {
            zero=true;
            for(j=0; j<n; j++)
            {
                scanf("%d",&b[i][j]);
                a[i][j]+=b[i][j];
                if(0!=a[i][j])
                    zero=false;
            }
            if(zero)
                count++;
        }
        for(j=0; j<n; j++)
        {
            zero=true;
            for(i=0; i<m; i++)
                if(0!=a[i][j])
                    zero=false;
            if(zero)
                count++;
        }
        printf("%d\n",count);
    }
 
    return 0;
}
 
/**************************************************************
    Problem: 1001
    User: windzhu
    Language: C++
    Result: Accepted
    Time:100 ms
    Memory:1012 kb
****************************************************************/