2011 浙大机试 A+B for Matrices

最新推荐文章于 2022-10-01 11:23:51 发布

有问必答不知道

最新推荐文章于 2022-10-01 11:23:51 发布

阅读量262

点赞数

分类专栏：考研机试题集文章标签：考研机试题集

本文链接：https://blog.csdn.net/u011396359/article/details/76652738

版权

考研机试题集专栏收录该内容

5 篇文章 0 订阅

订阅专栏

题目1001：A+B for Matrices

时间限制：1 秒

内存限制：32 兆

特殊判题：否

提交：23237

解决：9197

题目描述：

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

来源：

2011年浙江大学计算机及软件工程研究生机试真题

代码：

#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
const int maxn(12);
int matrix1[maxn][maxn];
int colums[maxn],rows[maxn];
int matrix2[maxn][maxn];
int matrix[maxn][maxn];
int main()
{
    int m, n;
    while(scanf("%d %d",&m, &n) != EOF && m != 0)
    {
        memset(colums,0,sizeof(colums));
        memset(rows,0,sizeof(rows));
        for(int i = 0; i < m; i++)
        {
            for(int j = 0; j < n; j++)
            {
                scanf("%d",&matrix1[i][j]);
            }
        }
        for(int i = 0; i < m; i++)
        {
            for(int j = 0; j < n; j++)
            {
                scanf("%d",&matrix2[i][j]);
            }
        }
        for(int i = 0; i < m; i++)
        {
            for(int j = 0; j < n; j++)
            {
                matrix[i][j] = matrix1[i][j] + matrix2[i][j];
                if(matrix[i][j])
                {
                    rows[i] = colums[j] = 1;
                }
            }
        }
        int row_res = 0;
        for(int i = 0; i < m; i++)
        {
            row_res += rows[i];
        }
        int column_res = 0;
        for(int j = 0; j < n; j++)
        {
            column_res += colums[j];
        }
        printf("%d\n",m + n - row_res - column_res);
    }
    return 0;
}