POJ 1753 Flip Game（枚举）

题目来源：http://poj.org/problem?id=1753

问题描述

Flip Game

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 51887		Accepted: 21880

Description

Flip game is played on a rectangular 4x4 field with two-sided pieces placed on each of its 16 squares. One side of each piece is white and the other one is black and each piece is lying either it's black or white side up. Each round you flip 3 to 5 pieces, thus changing the color of their upper side from black to white and vice versa. The pieces to be flipped are chosen every round according to the following rules: 

1. Choose any one of the 16 pieces. 
2. Flip the chosen piece and also all adjacent pieces to the left, to the right, to the top, and to the bottom of the chosen piece (if there are any).

Consider the following position as an example: 

bwbw 
wwww 
bbwb 
bwwb 
Here "b" denotes pieces lying their black side up and "w" denotes pieces lying their white side up. If we choose to flip the 1st piece from the 3rd row (this choice is shown at the picture), then the field will become: 

bwbw 
bwww 
wwwb 
wwwb 
The goal of the game is to flip either all pieces white side up or all pieces black side up. You are to write a program that will search for the minimum number of rounds needed to achieve this goal. 

Input

The input consists of 4 lines with 4 characters "w" or "b" each that denote game field position.

Output

Write to the output file a single integer number - the minimum number of rounds needed to achieve the goal of the game from the given position. If the goal is initially achieved, then write 0. If it's impossible to achieve the goal, then write the word "Impossible" (without quotes).

Sample Input

bwwb
bbwb
bwwb
bwww

Sample Output

4

Source

Northeastern Europe 2000

------------------------------------------------------------

题意

给定黑白棋棋盘，翻棋一次可将中心棋子及其周围（上/下/左/右）棋子由白变黑或由黑变白，问最少翻棋多少次可以使所有棋子都是白棋或都是黑棋？

------------------------------------------------------------

思路

枚举。第一行的棋子可以随意翻(1<<n种情况)，之后每行的棋子根据上一行的情况翻：如果上一行这一列是白棋而最后要求全黑，则下一行这一列翻棋。如此可以保证前n-1行都是黑棋，此时只需判断最后一行是否是黑棋即可。如果都是黑棋，则是合法的方法。

坑点：不能用scanf(“%c”, &ch)读取字符，这样会把’\n’读进来。要用scanf(“%s”,str)一行一行读。

------------------------------------------------------------

代码