首页 > 其他 > 详细

1001.A+B for Matrices

时间:2018-10-02 16:00:01      阅读:175      评论:0      收藏:0      [点我收藏+]
题目描述:

    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;
} 

 

1001.A+B for Matrices

原文:https://www.cnblogs.com/bernieloveslife/p/9736595.html

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!