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.OutputWrite 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 InputbwwbbbwbbwwbbwwwSample Output4AC代碼：#include<stdio.h>int map[4][4],step,flag=0;void turn(int i,int j)//轉換{ map[i][j]=!map[i][j]; if(i>0) map[i-1][j]=!map[i-1][j]; if(i<3) map[i+1][j]=!map[i+1][j]; if(j>0) map[i][j-1]=!map[i][j-1]; if(j<3) map[i][j+1]=!map[i][j+1];}int range()//判定表格是否全部一樣{ int i,j; for(i=0; i<4; i++) for(j=0; j<4; j++) if(map[i][j]!=map[0][0]) return 0; return 1;}int DFS(int i,int j,int dp)//深搜{ if(dp==step) { flag=range(); return 0; } if(flag||i==4)return 1; turn(i,j); if(j<3)DFS(i,j+1,dp+1); else DFS(i+1,0,dp+1); turn(i,j); if(j<3)DFS(i,j+1,dp); else DFS(i+1,0,dp); return 0;}int main(){ int i,j; char a; for(i=0; i<4; i++) { for(j=0; j<4; j++) { scanf("%c",&a); if(a=='b')map[i][j]=0; else map[i][j]=1; } getchar(); } for(step=0; step<=16; step++) { flag=0; DFS(0,0,0); if(flag)break; } if(flag)printf("%d/n",step); else printf("Impossible/n"); return 0;}
新聞熱點
疑難解答
