Kalevitch and Chess
Time Limit: 2000MS |
|
Memory Limit: 65536KB |
|
64bit IO Format: %i64d &%i64u |
Submit Status
Description
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 has been playing this old game on uninteresting, monotonous boards. Kalevitch decided to put the 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?x?8 grid, each square was painted black or white. Kalevitch suggests that chessboards should being painted in the following manner:there should be chosen a horizontal or a ve Rtical 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-one or more times. It is allowed-to-paint a square many times, but after the first time it does don't change it colour any more and remains BL Ack. Kalevitch paints chessboards neatly, and it is impossible to judge by an individual square if it's painted with a V Ertical or a horizontal stroke.
Kalevitch hopes that such chessboards would gain popularity, and he'll be commissioned to paint chessboards, which'll h ELP him ensure a comfortable old age. The clients would inform him what chessboard they want to has, and the painter would paint a white chessboard meeting the C Lient ' s requirements.
It goes without saying, such business one should economize on everything-for each commission he wants to know the Minimum amount of strokes that he had to paint to fulfill the client ' s needs. You is asked to the help Kalevitch with the 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 Chara Cter-for a square painted black.
It is guaranteed this client ' s requirments can be fulfilled with a sequence of allowed strokes (Vertical/column or horizon Tal/row).
Output
Output the only number-the minimum amount of rows and columns that kalevitch have to paint on the white chessboard to Mee t the client ' s requirements.
Sample Input
Input
Wwwbwwbwbbbbbbbbwwwbwwbwwwwbwwbwwwwbwwbwwwwbwwbwwwwbwwbwwwwbwwbw
Output
3
Input
Wwwwwwwwbbbbbbbbwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwww
Output
1
Source
Codeforces Beta Round #7
Test Instructions:
There is a 8*8 board, each square has a part of the White (W), and now a part is painted black (B), now to paint the entire board white, ask at least how many lines (column) to be painted, the whole board becomes white.
PS: English slag Ah, read someone else's code to know to be coated is definitely the whole row or column, simulation on it, by the way attached to the code Q God.
AC Code:
#include <iostream>using namespace Std;char a[10][10];bool black_row (int x)//Line {for (int i=0;i<8;i++) if (a[x][i]== ' W ') return false; return true;} BOOL Black_col (int x)//column {for (int i=0;i<8;i++) if (a[i][x]== ' W ') return false; return true;} int main () {for (int i=0;i<8;i++) cin>>a[i]; int black=0; int ans=0; for (int i=0;i<8;i++) if (Black_row (i)) ans++; for (int i=0;i<8;i++) if (Black_col (i)) ans++; if (ans==16) ans=8; cout<<ans<<endl; return 0;}
Q God code: Worship!
#include <cstdio> #include <cstring> #include <cstdlib> #include <cmath> #include <iostream > #include <algorithm>using namespace Std;char s[15][15];int Main () {for (int i=0;i<8;i++) scanf (" %s ", S[i]);//b->w bool flag=0; int x, y; for (int i=0;i<8;i++) for (int j=0;j<8;j++) if (s[i][j]== ' W ') { flag=1; x=i; y=j; } if (!flag) return 0*printf ("8");//all B int res=0; for (int i=0;i<8;i++) res+=s[i][y]== ' B '; for (int j=0;j<8;j++) res+=s[x][j]== ' B '; Return 0*printf ("%d", res);}
codeforces-7a Kalevitch and Chess (search?! Analog!)