标签：res stream nat hat NPU bre 描述 one contain
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> using namespace std; int main(){ int a[15][15]={0},b[15][15]={0}; int m,n,i,j; while(cin>>m){ int num=0; int sum1,sum2; if(m==0) break; 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]; } } for(i=0;i<m;i++){ sum1=0,sum2=0; for(j=0;j<n;j++){ sum1+=a[i][j]; sum2+=b[i][j]; } if(sum1+sum2==0) num++; } for(j=0;j<n;j++){ sum1=0,sum2=0; for(i=0;i<m;i++){ sum1+=a[i][j]; sum2+=b[i][j]; } if(sum1+sum2==0) num++; } cout<<num<<endl; } return 0; }
标签：res stream nat hat NPU bre 描述 one contain
原文地址：https://www.cnblogs.com/bernieloveslife/p/9736595.html
