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
#include<iostream>
#define M 10
using namespace std;
int main(){
int row,col,i,j,zeroCount;
int m1[M][M],m2[M][M],m3[M][M];
while((cin>>row>>col) && row!=0){
zeroCount=0;
for(i=0;i<row;i++)
for(j=0;j<col;j++)
cin>>m1[i][j];
//scanf("%d",&m1[i][j]);
for(i=0;i<row;i++)
for(j=0;j<col;j++)
cin>>m2[i][j];
//scanf("%d",&m2[i][j]);
for(i=0;i<row;i++)
for(j=0;j<col;j++){
m3[i][j]=m1[i][j]+m2[i][j];
}
for(i=0;i<row;i++){
j=0;
while(j<col && (m3[i][j]==0)) j++;
if(j==col) zeroCount++;
}
/*
for(j=0;j<col && (m1[i][j]==0);j++)
if(j==col)
zeroCount++;
for(j=0;j<col;j++)
for(i=0;i<row && (m1[i][j]==0);i++)
if(i==row)
zeroCount++;
*/
for(j=0;j<col;j++){
i=0;
while(i<row && (m3[i][j]==0)) i++;
if(i==row) zeroCount++;
}
cout<<zeroCount<<endl;
}
//getchar();
return 0;
}