Buildings 2560
来源:互联网 发布:eosinfo软件 编辑:程序博客网 时间:2024/05/22 15:07
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
2
2 2
1 1
0 0
3 3
1 0 1
0 0 1
1 1 0
Sample Output
2
5
#include <iostream>int main(int argc, const char* argv[]){ int nCases = 0; std::cin >> nCases; while (nCases--) { int n = 0, m = 0; std::cin >> n >> m; int nTemp = 0, nCount = 0; for (int i=0; i<n; ++i) { for (int j=0; j<m; ++j) { std::cin >> nTemp; if (1 == nTemp) { ++nCount; } } } std::cout << nCount << std::endl; } return 0;}
- Buildings 2560
- HDU 2560 Buildings
- HDU-2560-Buildings
- hdu 2560 buildings
- hdu 2560 Buildings
- HDOJ 2560 Buildings (水题)
- Buildings
- Buildings
- Buildings
- Buildings
- Buildings
- Buildings
- Buildings
- Buildings
- Buildings
- Buildings
- Buildings
- hdu 2560 Buildings(超水)
- C++ 用libcurl库进行http通讯网络编程
- 《程序员,你伤不起》读书笔记 (七):IT软件创业之 -- 项目型创业不确定因素很多对管理上要求更高,赚钱很难、赚大钱更难
- 【Linux学习】GCC学习
- Java Observer接口学习
- 多个主库一个从库同步实施
- Buildings 2560
- 《计算机程序的构造和解释》学习笔记——数据抽象
- 虚函数与默认实参
- OpenCV编程->cvMeanShift函数
- ACM-DFS之Jerboas——hdu2437
- Unity3D学习随笔
- 文本相似度的计算-向量空间模型
- oracle having
- uva 11929The Dragon of Loowater