HDOJ_ACM_steps——Buildings

题目很简单，统计N*M矩阵中1的个数

一次ac

 

#include <iostream>
#include <string>
using namespace std;

int main() {
	int t;
	scanf("%d",&t);
	int n,m;
	int count;
	int temp;
	while(t){
		count = 0;
		scanf("%d%d",&n,&m);
		for(int i=0;i<n;i++)
			for(int j=0;j<m;j++){
				scanf("%d",&temp);
				if(temp == 1)
					count++;
			}
		printf("%d\n",count);
		t--;
	}

	return 0;
}