JOBDU Q1001

题目：数组求和，输出全为0的行列数。

/*
题目描述：
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 <iostream>
//#include <stdlib.h>
using namespace std;

int main()
{
	int a[10][10], b[10][10], c[10][10];
	int i, j, m, n, t = 0;

	//初始化
	for (i = 0; i < 10; i++)
		for (j = 0; j < 10; j++) {
			a[i][j] = 0;
			b[i][j] = 0;
			c[i][j] = 0;
		}
	cin >> m;
	while (m)
	{
		t = 0;
		cin >> n;
		
		//读入第一个数组
		for (i = 0; i < m; i++)
			for (j = 0; j < n; j++)
				cin >> a[i][j];

		//读入第二个数组并求和
		for (i = 0; i < m; i++)
			for (j = 0; j < n; j++) {
				cin >> b[i][j];
				c[i][j] = a[i][j] + b[i][j];
			}

		//计算全0的行列数
		for (i = 0; i < m; i++) {
			for (j = 0; j < n; j++) {
				if (c[i][j] != 0) break;
			}
			if (j == n) t++;
		}
		for (j = 0; j < n; j++) {
			for (i = 0; i < m; i++) {
				if (c[i][j] != 0) break;
			}
			if (i == m) t++;
		}
		cout << t << endl;
		cin >> m;
	}
	
	//system("pause");
	return 0;
}