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來源:
#includeusing namespace std; int main() { int a,b,a1[10][10],a2[10][10],a3[10][10],count=0; int i,j; while(cin >> a && a!=0) { cin>>b; count =0; for(i=0;i> a1[i][j]; } } for(i=0;i> a2[i][j]; } } for(i=0;i