A+B for Matrices

Problem Link：点击打开链接

题目描述

    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

AC code：

#include<iostream>
#include<algorithm>
#include<stdio.h>
#include<map>
#include<math.h>
#include<string.h>
#include<queue>
#include<vector>
#include<set>
#define LL long long
#define exp 1e-9
#define MAXN 1000010

using namespace std;

int a[11][11],b[11][11],c[11][11];

int main()
{
//	freopen("D:\\in.txt","r",stdin);
    int n,m,i,j,ans;
	while(scanf("%d",&m)!=EOF)
	{
		if(m==0) break;
		scanf("%d",&n);
		for(i=1;i<=m;i++)
		{
			for(j=1;j<=n;j++)
			{
				scanf("%d",&a[i][j]);
			}
		}
		for(i=1;i<=m;i++)
		{
			for(j=1;j<=n;j++)
			{
				scanf("%d",&b[i][j]);
			}
		}
		for(i=1;i<=m;i++)
		{
			for(j=1;j<=n;j++)
			{
				c[i][j]=a[i][j]+b[i][j];
			}
		}
		ans=0;
		for(i=1;i<=m;i++)
		{
			for(j=1;j<=n;j++)
			{
				if(c[i][j]!=0)
					break;
			}
			if(j==n+1)
				ans++;
		}
		for(i=1;i<=n;i++)
		{
			for(j=1;j<=m;j++)
			{
				if(c[j][i]!=0)
					break;
			}
			if(j==m+1)
				ans++;
		}
		printf("%d\n",ans);
	}
	return 0;
}