九度OJ题目1001：A+B for Matrices

题目1001：A+B for Matrices

时间限制：1 秒

内存限制：32 兆

特殊判题：否

题目描述：

    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 
int main(){
    int m,n,sum1,sum2,ans;//sum1表示行的和，sum2表示列的和，ans表示行，列和为0的数 
    while(scanf("%d%d",&m,&n)==2){
        int a[m][n],b[m][n];//定义二维数据保存矩阵信息 
        //输入矩阵a 
        for(int i=0;i