题目1001: A+B for Matrices

最新推荐文章于 2021-03-16 11:34:59 发布

DafuTT

最新推荐文章于 2021-03-16 11:34:59 发布

阅读量408

点赞数

本文链接：https://blog.csdn.net/u012816621/article/details/44133721

版权

题目1001：A+B for Matrices

时间限制：1 秒

内存限制：32 兆

特殊判题：否

提交：15656

解决：6332

题目描述：

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.

样例输入：

样例输出：

1
5

#include <iostream>
#include <stdio.h>
#include <stdlib.h>
using namespace std;

int main()
{
    int m,n;
    while(cin>>m>>n)
    {
        if(m==0)
            exit(0);
        int a[m][n],b[m][n];
        bool c[m][n];
        int count=0;
        for(int i=0;i<m;i++)
            for(int j=0;j<n;j++)
                cin>>a[i][j];
        for(int i=0;i<m;i++)
            for(int j=0;j<n;j++)
                cin>>b[i][j];
        for(int i=0;i<m;i++)
            for(int j=0;j<n;j++)
                if(a[i][j]+b[i][j]==0)
                    c[i][j]=1;
                else
                    c[i][j]=0;
        for(int i=0;i<m;i++)
        {
            bool flag =true;
            for(int j=0;j<n;j++)
                if(c[i][j]==0)
                    flag =false;
            if(flag)
                count++;
        }
        for(int i=0;i<n;i++)
        {
            bool flag =true;
            for(int j=0;j<m;j++)
                if(c[j][i]==0)
                    flag =false;
            if(flag)
                count++;
        }
        cout<<count<<endl;

    }

}