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

答疑：

解题遇到问题?分享解题心得?讨论本题请访问：http://t.jobdu.com/thread-7724-1-1.html

#include <cstdio>
const int maxn=12;
int a[maxn][maxn],b[maxn][maxn],c[maxn][maxn];

int main(){
    int m,n;
    while(~scanf("%d%d",&m,&n)&&m){
        for(int i=0;i<m;i++)
            for(int j=0;j<n;j++)
                scanf("%d",&a[i][j]);
        for(int i=0;i<m;i++)
            for(int j=0;j<n;j++)
                scanf("%d",&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];
        int cnt=0;
        for(int i=0;i<m;i++){
            int ok=1;
            for(int j=0;j<n;j++) if(c[i][j]) ok=0;
            if(ok) cnt++;
        }
        for(int j=0;j<n;j++){
            int ok=1;
            for(int i=0;i<m;i++) if(c[i][j]) ok=0;
            if(ok) cnt++;
        }
        printf("%d\n",cnt);
    }
    return 0;
}