zoukankan      html  css  js  c++  java
  • 1.2.3 Buildings 76.38%(582,762)

    Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
    Total Submission(s): 762 Accepted Submission(s): 582
     
    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<iostream>
    using namespace std;

    int main()
    {
    int i,j,k,n,m,t,num=0,grid[100][100];
    cin>>t;
    for(i=0;i<t;i++){
    cin>>n>>m;
    for(j=0;j<n;j++){
    for(k=0;k<m;k++){
    cin>>grid[j][k];
    if(grid[j][k]==1)num++;
    }
    }
    cout<<num<<endl;
    num=0;
    }
    return 0;
    }
  • 相关阅读:
    MySQL 处理重复数据
    MySQL 序列使用
    MySQL 元数据
    MySQL 临时表和复制表
    MySQL 索引
    MySQL ALTER命令-修改数据表名或者修改数据表字段
    MySQL 事务
    MySQL 正则表达式
    MySQL NULL 值处理
    MySQL 排序
  • 原文地址:https://www.cnblogs.com/yangshuo/p/2358233.html
Copyright © 2011-2022 走看看