首页 > ACM题库 > HDU-杭电 > hdu 2560 Buildings[解题报告]C++
2014
02-10

hdu 2560 Buildings[解题报告]C++

Buildings

问题描述 :

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.

输入:

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.

输出:

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.

样例输入:

2
2 2
1 1
0 0
3 3
1 0 1
0 0 1
1 1 0

样例输出:

2
5

2011-12-28 09:55:00

地址:http://acm.hdu.edu.cn/showproblem.php?pid=2560

题意:给n*m的0-1矩阵,问有多少个1。。。

mark:这么水的题好爽!

代码:

# include <stdio.h>


int main ()
{
    int T, n, m, i, num, sum ;
    scanf ("%d", &T) ;
    while (T--)
    {
        scanf ("%d%d", &n, &m) ;
        sum = 0 ;
        for (i = 0 ; i < n*m ; i++)
        {
            scanf ("%d", &num) ;
            sum += num ;
        }
        printf ("%d\n", sum) ;
    }
    return 0 ;
}

解题转自:http://www.cnblogs.com/lzsz1212/archive/2012/01/07/2315398.html