hdu 2506 Buildings

题意：记录有多少个1，水题啦！

#include<iostream>
using namespace std;

int main(){
    int t,n,m,temp,sum;
    cin>>t;
    while(t--){
        cin>>n>>m;
        sum = 0;
        for(int i=0;i<n;i++){
            for(int j=0;j<m;j++){
                cin>>temp;
                // 屌丝写法
                if((temp&0x1)==0x1){
                    sum++;
                }
            }
        }
        cout<<sum<<endl;
    }
    return 0;
}

Buildings

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)

Total Submission(s): 2893 Accepted Submission(s): 2440



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.
我们把HZNU大学的校园分割成N*M 网格的大小，正如你看到下面的表格，绿色的方块表示建筑物。
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.
输入将包含多组测试数据。输入的第一行是一个整数T，表示有T组数据。接下来输入T组数据。

The first line of each test case contains two integers n and m(1<=n,m<=100), the size of the campus.
每组测试数据的第一行，有两个正整数，分别是n和m，他们表示校园的大小。
Then follow n lines, each line containing m integers.
然后再输入n行数据，每行m个整数。
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.

第i行j列的整数表示一个有颜色的格子，0表示白色的格子，1表示绿色的格子。


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

Source
2008 HZNU Programming Contest