Flip Game

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

题意：在4x4的方格内放置了一些黑白棋子，b代表黑色，w代表白色，翻转一个棋子则它四个方向的棋子（如果存在棋子的话）都得翻个个儿，问至少几次翻转使所有的棋子都为黑色或都为白色。输出次数。

思路：这个题是深搜题，从右下角开始搜，将其四个方向（如果存在棋子的话）都翻个个儿，然后算一下黑子或白子的个数，如果等于零或等于16对minn进行一个更新。代码如下：

#include<stdio.h>
#include<string.h>
int flag,minn=99999999;
void angel(int n,int k,char a[10][10])
{
    int i,j,sum=0;
    char b[10][10];
    for(i=0; i<4; i++)
    {
        for(j=0; j<4; j++)
        {
            if(a[i][j]=='b')
                sum++;
        }
    }
    if(sum==16||sum==0)
    {
        if(k<minn)
        {
            flag=1;
            minn=k;
        }
        return ;
    }
    if(n==16)
        return ;
    for(i=0; i<4; i++)
        strcpy(b[i],a[i]);
    angel(n+1,k,b);
    int x=n/4;
    int y=n%4;
    if(b[x][y]=='b')
        b[x][y]='w';
    else
        b[x][y]='b';
    if(y>=1)
    {
        if(b[x][y-1]=='b')
            b[x][y-1]='w';
        else
            b[x][y-1]='b';
    }
    if(y<=2)
    {
        if(b[x][y+1]=='b')
            b[x][y+1]='w';
        else
            b[x][y+1]='b';
    }
    if(x>=1)
    {
        if(b[x-1][y]=='b')
            b[x-1][y]='w';
        else
            b[x-1][y]='b';
    }
    if(x<=2)
    {
        if(b[x+1][y]=='b')
            b[x+1][y]='w';
        else
            b[x+1][y]='b';
    }
    angel(n+1,k+1,b);
}
int main()
{
    flag=0;
    char a[10][10];
    for(int i=0; i<4; i++)
        scanf("%s",a[i]);
    angel(0,0,a);
    if(flag==1)
        printf("%d\n",minn);
    else
        printf("Impossible\n");
}