Flip Game
来源:互联网 发布:杨千嬅 知乎 编辑:程序博客网 时间:2024/06/02 03:52
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:
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.
- Choose any one of the 16 pieces.
- 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.
The input consists of 4 lines with 4 characters "w" or "b" each that denote game field position.
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).
bwwbbbwbbwwbbwww
4
题意:
最少改变几次,使得棋盘全为b或w,dfs16个棋子,找到最小的次数;
代码如下:
#include <stdio.h>#include <string.h>int min = 0xfffffff;void dfs(int n,int num,char a[][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(num<min)//更新最小的 min=num;return;}if(n==16) return;for(i=0;i<4; i++)strcpy(b[i],a[i]);dfs(n+1,num,b);//棋子没被改变 int x=n/4;int y=n%4;if(b[x][y]=='b')b[x][y]='w';elseb[x][y]='b';if(x >= 1){if(b[x-1][y]=='b')b[x-1][y]='w';elseb[x-1][y]='b';}if(x<=2){if(b[x+1][y]=='b')b[x+1][y]='w';elseb[x+1][y]='b';}if(y>=1){if(b[x][y-1]=='b')b[x][y-1]='w';elseb[x][y-1]='b';}if(y<=2){if(b[x][y+1]=='b')b[x][y+1]='w';elseb[x][y+1]='b';}dfs(n+1,num+1,b);//棋子改变 }int main(){char a[10][10];int i;for(i = 0;i < 4; i++)scanf("%s",a[i]);dfs(0,0,a); printf("%d\n",min);return 0;}
阅读全文
0 0
- Flip Game
- Flip Game
- Flip Game
- Flip Game
- Flip Game
- Flip Game
- flip game
- Flip Game
- Flip Game
- FLIP GAME
- Flip Game
- Flip Game
- Flip Game
- Flip Game
- Flip Game
- Flip Game
- Flip Game
- Flip Game
- [数据库事务与锁]详解二: 数据库的读现象浅析
- CoreData创建托管对象子类后 编译文件重复错误
- Spring原理之代理与动态代理模式总结(四)
- SpringBoot中使用数据缓存
- Android动画笔记
- Flip Game
- centos 6 将python 2.6 升级到python 2.7
- 推荐MongoDB教程
- js中对于DOM1的扩展
- 视图抖动
- 【代码】N个非定长升序数组 合并成一个升序数组
- 【Unity3D入门】Unity3D学习笔记002——Visual Studio的下载、安装、破解与配置
- Android Context 上下文 你必须知道的一切
- EasyUI—点击tab内容中的链接,在父级tab上新增一个tab