题目描述:
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<stdio.h>
#include<iostream>
#include<memory.h>
using namespace std;
int main(){
int column, row;
int matrices[21][21];
while (scanf("%d%d", &row, &column) == 2){
memset(matrices, -1, sizeof(matrices));
for (int i = 0; i < row * 2; i++){
for (int j = 0; j < column; j++){
scanf("%d", &matrices[i][j]);
}
}
int result[11][11];
memset(result, -1, sizeof(result));
for (int i = 0; i < row; i++){
for (int j = 0; j < column; j++){
if (row > 1){
int tmp;
tmp = matrices[i + row ][j];
int sumTemp = matrices[i][j] + tmp;
if (sumTemp == 0){
result[i][j] = 0;
}
}
}
}
int rowSum = row;
int columnSum = column;
int totalSum = 0;
for (int i = 0; i < row; i++){
for (int j = 0; j < column; j++){
if (result[i][j] != 0){
rowSum--;
break;
}
}
}
for (int j = 0; j < column; j++){
for (int i = 0; i < row; i++){
if (result[i][j] != 0){
columnSum--;
break;
}
}
}
totalSum = rowSum + columnSum;
if (row == 1 || column == 1){
if (totalSum == (row + column)){
totalSum--;
}
}
cout << totalSum << endl;
}
}