Codeforces Round #294 (Div. 2)

A. A and B and Chess time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output

A and B are preparing themselves for programming contests.

To train their logical thinking and solve problems better, A and B decided to play chess. During the game A wondered whose position is now stronger.

For each chess piece we know its weight:

• the queen's weight is 9,
• the rook's weight is 5,
• the bishop's weight is 3,
• the knight's weight is 3,
• the pawn's weight is 1,
• the king's weight isn't considered in evaluating position.

  The player's weight equals to the sum of weights of all his pieces on the board.

  As A doesn't like counting, he asked you to help him determine which player has the larger position weight.

  Input

  The input contains eight lines, eight characters each — the board's description.

  The white pieces on the board are marked with uppercase letters, the black pieces are marked with lowercase letters.

  The white pieces are denoted as follows: the queen is represented is 'Q', the rook — as 'R', the bishop — as'B', the knight — as 'N', the pawn — as 'P', the king — as 'K'.

  The black pieces are denoted as 'q', 'r', 'b', 'n', 'p', 'k', respectively.

  An empty square of the board is marked as '.' (a dot).

  It is not guaranteed that the given chess position can be achieved in a real game. Specifically, there can be an arbitrary (possibly zero) number pieces of each type, the king may be under attack and so on.

  Output

  Print "White" (without quotes) if the weight of the position of the white pieces is more than the weight of the position of the black pieces, print "Black" if the weight of the black pieces is more than the weight of the white pieces and print "Draw" if the weights of the white and black pieces are equal.

  Sample test(s) input

  ...QK...
  ........
  ........
  ........
  ........
  ........
  ........
  ...rk...
  

  output

  White
  

  input

  rnbqkbnr
  pppppppp
  ........
  ........
  ........
  ........
  PPPPPPPP
  RNBQKBNR
  

  output

  Draw
  

  input

  rppppppr
  ...k....
  ........
  ........
  ........
  ........
  K...Q...
  ........
  

  output

  Black
  

  Note

  In the first test sample the weight of the position of the white pieces equals to 9, the weight of the position of the black pieces equals 5.

  In the second test sample the weights of the positions of the black and the white pieces are equal to 39.

  In the third test sample the weight of the position of the white pieces equals to 9, the weight of the position of the black pieces equals to 16.

  
  

  
  

  
  

  
  

  思路：簡單題，不過有坑點，注意the knight — as 'N',這裡還被hack一次，╮(╯▽╰)╭

  
  

  AC代碼：

  #include 
  #include 
  #include 
  #include 
  #include 
  #define LL long long
  using namespace std;
  
  char a[10];
  
  int val(char c) {
  	if(c == 'Q' || c == 'q') return 9;
  	else if(c == 'R' || c == 'r') return 5;
  	else if(c == 'B' || c == 'b') return 3;
  	else if(c == 'N' || c == 'n') return 3;
  	else if(c == 'P' || c == 'p') return 1;
  	else return 0;
  }
  
  int main() {
  	int w = 0, b = 0;
  	int t = 8;
  	while(t--) {
  		scanf("%s", a);
  		int len = strlen(a);
  		for(int i = 0; i < len; i++) {
  			if(a[i] <= 'Z' && a[i] >= 'A') w += val(a[i]);
  			else if(a[i] <= 'z' && a[i] >= 'a') b += val(a[i]);
  		}
  	}
  		
  	if(w == b) printf("Draw\n");
  	else if(w > b) printf("White\n");
  	else if(w < b) printf("Black\n");
  	return 0;
  }