统计矩阵中零行和零列的个数

题目描述：

    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 21 11 1-1 -110 92 31 2 34 5 6-1 -2 -3-4 -5 -60

样例输出：

15

来源：

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

分析：

1 2 34 5 6

和

-1 -2 -3-4 -5 -6

相加后得到

0 0 0

0 0 0

共有 2零行 +3零列 =5

#include<stdio.h>#include<malloc.h> int main(){    int m,n,i,j,count;    while(scanf("%d",&m) && m){         scanf("%d",&n);         int *a=(int *)malloc(m*n*sizeof(int));        int *b=(int *)malloc(m*n*sizeof(int));         for(i=0;i<m*n;++i)            scanf("%d",a+i);        for(i=0;i<m*n;++i)            scanf("%d",b+i);        for(i=0;i<m*n;++i)            a[i]=a[i]+b[i];         count=m+n;        //检查有没有0行        for(i=0;i<m*n;i+=n){            for(j=0;j<n;++j){                if(a[i+j]!=0){                    --count;                    break;                }            }        }         //检查有没有0 的列        for(i=0;i<n;++i){            for(j=0;i+j<m*n;j+=n){                if(a[i+j]!=0){                    --count;                    break;                }            }        }         printf("%d\n",count);        free(a);        free(b);     }    return 0;}