HDU2560：Buildings

最新推荐文章于 2024-08-03 22:30:59 发布

键盘上的舞者

最新推荐文章于 2024-08-03 22:30:59 发布

阅读量943

点赞数

CC 4.0 BY-SA版权

分类专栏：水文章标签： ACM HDU 杭电解题报告

本文链接：https://blog.youkuaiyun.com/libin56842/article/details/8876507

水专栏收录该内容

330 篇文章

订阅专栏

本题要求统计给定校园网格中绿色建筑的数量。输入包括多个测试用例，每个用例给出校园的尺寸及各网格的颜色（0为白色，1为绿色）。程序需输出每个测试用例中绿色网格的总数。

Problem Description

We divide the HZNU Campus into N*M grids. As you can see from the picture below, the green grids represent the buidings. Given the size of the HZNU Campus, and the color of each grid, you should count how many green grids in the N*M grids.

Input

Standard input will contain multiple test cases. The first line of the input is a single integer T which is the number of test cases. T test cases follow.
The first line of each test case contains two integers n and m(1<=n,m<=100), the size of the campus. Then follow n lines, each line containing m integers. The j-th integer in the i-th line is the color of that grid, 0 stands for white color, while 1 stands for green.

Output

Results should be directed to standard output. For each case, output an integers T, the total green grids in the N*M size campus.

Sample Input

Sample Output

2
5

题目那么长，答案那么水，我都无语了

就是统计方阵里1的个数

#include <iostream>
using namespace std;

int main()
{
    int t;
    cin >> t;
    while(t--)
    {
        int a,b,i,j,f,cnt = 0;
        cin >> a >> b;
        for(i = 0;i<a;i++)
        {
            for(j = 0;j<b;j++)
            {
                cin >> f;
                if(f)
                cnt++;
            }
        }
        cout << cnt << endl;
    }

    return 0;
}