題目1001：A+B for Matrices

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年浙江大學計算機及軟件工程研究生機試真題

AC代碼：

//本題關鍵在於讀懂題意：
//將兩個同型矩陣相加後，統計為0的行數（該行所有元素都為0）和列數

#include
#define N 10

int matrices[N][N]; //存儲矩陣

int main() {
	//freopen("in.txt","r",stdin);
	int m, n, num;
	while(scanf("%d %d",&m,&n)!=EOF && m) {
		int i, j, a;
		for(i=0; i