【九度OJ】1001：A+B for Matrices

地址：
http://ac.jobdu.com/problem.php?pid=1001
题目描述：
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年浙江大学计算机及软件工程研究生机试真题

题目大意：
将两个矩阵相加，求和矩阵中全是零的行和列的个数

源码：

#include<stdio.h>

int n, m;
int matrixA[ 15 ][ 15 ];    //矩阵A，矩阵A+B
int matrixB[ 15 ][ 15 ];    //矩阵B

int main(){
    while( scanf( "%d", &m) != EOF ){
        if( m == 0 ){
            return 0;
        }
        scanf( "%d", &n );
        for( int i = 0; i < m; i ++ ){
            for( int j = 0; j < n; j ++ ){
                scanf( "%d", &matrixA[ i ][ j ] );
            }
        }
        for( int i = 0; i < m; i ++ ){
            for( int j = 0; j < n; j ++ ){
                scanf( "%d", &matrixB[ i ][ j ] );
            }
        }

        for( int i = 0; i < m; i ++ ){
            for( int j = 0; j < n; j ++ ){
                matrixA[ i ][ j ] += matrixB[ i ][ j ];
            }
        }

        int count = 0;
        //行
        for( int i = 0; i < m; i ++ ){
            int flag = 1;
            for( int j = 0; j < n; j ++ ){
                if( matrixA[ i ][ j ] != 0 ){
                    flag = 0;
                    break;
                }
            }
            if( flag == 1 ){
                count++;
            }
        }

        //列
        for( int j = 0; j < n; j ++ ){
            int flag = 1;
            for( int i = 0; i < m; i ++ ){
                if( matrixA[ i ][ j ] != 0 ){
                    flag = 0;
                    break;
                }
            }
            if( flag == 1 ){
                count++;
            }
        }

        printf( "%d\n", count );

    }
}