HDU 2560 Buildings

最新推荐文章于 2019-01-06 21:34:03 发布

weixin_30363981

最新推荐文章于 2019-01-06 21:34:03 发布

阅读量84

点赞数

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/xyoung/archive/2010/11/16/1878697.html

本文提供了一道名为HDU2560 Buildings的编程题解题思路及代码实现。任务是在给定的网格中计算绿色网格（代表建筑物）的数量。通过输入校园的大小和每个网格的颜色信息，程序能够输出绿色网格的总数。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

HDU 2560 Buildings

超水题...

代码

#include < stdio.h >

int main()
{
int cas, n, m, count, i, index;

scanf( " %d " , & cas);
while (cas -- )
{
scanf( " %d%d " , & n, & m);
count = 0 ;
for (i = 1 ; i <= n * m; i ++ )
{
scanf( " %d " , & index);
if ( index )
{
count ++ ;
}
}

printf( " %d\n " , count);
}
}

/*
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
2
2 2
1 1
0 0
3 3
1 0 1
0 0 1
1 1 0

Sample Output
2
5
*/