zoukankan      html  css  js  c++  java
  • cf 7A

    A. Kalevitch and Chess
    time limit per test
    2 seconds
    memory limit per test
    64 megabytes
    input
    standard input
    output
    standard output

    A famous Berland's painter Kalevitch likes to shock the public. One of his last obsessions is chess. For more than a thousand years people have been playing this old game on uninteresting, monotonous boards. Kalevitch decided to put an end to this tradition and to introduce a new attitude to chessboards.

    As before, the chessboard is a square-checkered board with the squares arranged in a 8 × 8 grid, each square is painted black or white. Kalevitch suggests that chessboards should be painted in the following manner: there should be chosen a horizontal or a vertical line of 8 squares (i.e. a row or a column), and painted black. Initially the whole chessboard is white, and it can be painted in the above described way one or more times. It is allowed to paint a square many times, but after the first time it does not change its colour any more and remains black. Kalevitch paints chessboards neatly, and it is impossible to judge by an individual square if it was painted with a vertical or a horizontal stroke.

    Kalevitch hopes that such chessboards will gain popularity, and he will be commissioned to paint chessboards, which will help him ensure a comfortable old age. The clients will inform him what chessboard they want to have, and the painter will paint a white chessboard meeting the client's requirements.

    It goes without saying that in such business one should economize on everything — for each commission he wants to know the minimum amount of strokes that he has to paint to fulfill the client's needs. You are asked to help Kalevitch with this task.

    Input

    The input file contains 8 lines, each of the lines contains 8 characters. The given matrix describes the client's requirements, W character stands for a white square, and B character — for a square painted black.

    It is guaranteed that client's requirments can be fulfilled with a sequence of allowed strokes (vertical/column or horizontal/row).

    Output

    Output the only number — the minimum amount of rows and columns that Kalevitch has to paint on the white chessboard to meet the client's requirements.

    Sample test(s)
    input
    WWWBWWBW
    BBBBBBBB
    WWWBWWBW
    WWWBWWBW
    WWWBWWBW
    WWWBWWBW
    WWWBWWBW
    WWWBWWBW
    output
    3
    input
    WWWWWWWW
    BBBBBBBB
    WWWWWWWW
    WWWWWWWW
    WWWWWWWW
    WWWWWWWW
    WWWWWWWW
    WWWWWWWW
    output
    1
    #include<iostream>
    #include<cstdio>
    #include<cstring>
    #include<cmath>
    #include<cstdlib>
    #include<string>
    #include<algorithm>
    using namespace std;
    char s[10][10];
    int ans,tt,temp;
    int main()
    {
          for(int i=0;i<8;i++)
                scanf("%s",s[i]);
          for(int i=0;i<8;i++)
          {
                temp=0;
                for(int j=0;j<8;j++)
                      if(s[i][j]=='B')
                            temp++;
                if(temp==8)
                      ans++;
                else
                    tt=temp;
          }
          printf("%d
    ",ans+tt);
          return 0;
    }
    

      

  • 相关阅读:
    Java GC机制详解
    程序员面试的时候如何谈薪酬待遇?
    每个程序员都会遇到的面试问题:谈谈进程和线程的区别
    面试问题:你了解Java内存结构么(Java7、8、9内存结构的区别)
    UVa 208
    山科 STUST OJ Problem B: 编写函数:String to Double (II) (Append Code)
    山科SDUST OJ Problem J :连分数
    辗转相除法
    [比赛总结]ACM div3 G 比赛总结
    SDUST OJ Problem G 动态的字符串排序
  • 原文地址:https://www.cnblogs.com/a972290869/p/4219012.html
Copyright © 2011-2022 走看看