ACM 砖块计数
来源:互联网 发布:淘宝精密管 编辑:程序博客网 时间:2024/05/16 18:27
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
Source
2008 HZNU Programming Contest
Recommend
lcy
#include<stdio.h>#define MAX 100main(){ int t,i,j,k,l,sum,a; scanf("%d",&t); while(t--) { sum=0; scanf("%d %d",&i,&j); for(k=0;k<i;k++) { for(l=0;l<j;l++) { scanf("%d",&a); if(a==1) sum++; } } printf("%d\n",sum); } return 0;}
- ACM 砖块计数
- acm-polya计数公式
- ACM计数问题
- ACM程序设计书中题目--k (移动砖块)
- ACM-计数排序小例子
- ACM 158. [USACO Oct07] 奶牛饮水(计数)
- ACM组队安排 (DFS+计数原理)
- 打砖块
- 砖块2
- 铺砖块
- 铺砖块
- 堆砖块
- 堆砖块
- 打砖块
- 打砖块
- [ACM] poj 1496 Word Index(组合计数)
- [ACM] POJ 2409 Let it Bead (Polya计数)
- [ACM] ZOJ 3725 Painting Storages (DP计数+组合)
- 不要做个浮躁的程序员
- Ubuntu14.04 LTS在VMware虚拟机中设置1080P启动
- 在SQL存储过程中给条件变量加上单引号
- VxWorks内核解读-1
- django缓存优化 Redis缓存介绍
- ACM 砖块计数
- Android Studio 下载 使用教程
- OpenCV3.1 Windows下新建工程
- mysql常见问题
- 【CodeForces】554B - Ohana Cleans Up(思维)
- VS2012+NShader1.3
- 用MyEclipse6.5但是在添注册码时老是不能进行finish这一步 The subscription code is not a Blue edition code.
- acm 2 1016 Red and Black
- 裸板程序--韦东山第4课 MMU实验