题目1001：A+B for Matrices

最新推荐文章于 2024-08-04 23:08:55 发布

杨瘦锅

最新推荐文章于 2024-08-04 23:08:55 发布

阅读量211

点赞数

分类专栏：算法文章标签：算法

本文链接：https://blog.csdn.net/qq_21063873/article/details/52739061

版权

算法专栏收录该内容

24 篇文章 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.

样例输入：

样例输出：

思路：用辅助空间在第二个矩阵输入的同时计算对应位置的和，并且计算 i行和 j列的对应的累加值。最后扫描，得到行列值为0的元素的个数。

code:

#include <bits/stdc++.h>

using namespace std;

int main(){

    int a[100][100] ;
    int m ,  n ;
    while (cin>>m && m!=0){
            cin>>n;
            for (int i = 0 ; i < m ; ++i){
            a[i][n] = 0 ;
                for (int j = 0 ; j <n ; ++j){
                a[m][j] = 0 ;
                    cin>>a[i][j];
                }
            }
            int t ;
            for (int i = 0 ; i < m ; ++i){
                for (int j = 0 ; j <n ; ++j){
                    cin>>t;
                    a[i][j]+=t;
                    a[i][n]+=a[i][j] ;
                    a[m][j]+=a[i][j];
                }
            }
            int sum =  0;
            for (int i = 0 ; i < m ;++i)
                if (a[i][n] == 0 ) sum++;
            for (int j = 0 ; j < n ;++j)
                if (a[m][j] == 0 ) sum++;
                cout<<sum<<endl ;
    }

    return 0;
}