http://acm.hdu.edu.cn/showproblem.php?pid=2560
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.
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
1 #include <iostream> 2 using namespace std; 3 int main() 4 { 5 int n,a,b,s,t; 6 cin >> n; 7 for (int i=1;i<=n;i++) 8 { 9 cin >> a >> b; 10 t=0; 11 for (int j=1;j<=a*b;j++) 12 { 13 cin >> s; 14 if (s==1) 15 t++; 16 } 17 cout << t << endl; 18 } 19 return 0; 20 }
微信公众号： 猿人谷
如果您认为阅读这篇博客让您有些收获，不妨点击一下右下角的【推荐】
如果您希望与我交流互动，欢迎关注微信公众号
本文版权归作者和博客园共有，欢迎转载，但未经作者同意必须保留此段声明，且在文章页面明显位置给出原文连接。
