【DFS】HDU5547Sudoku
来源:互联网 发布:360验机软件 编辑:程序博客网 时间:2024/06/02 19:29
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=5547
Problem Description
Yi Sima was one of the best counselors of Cao Cao. He likes to play a funny game himself. It looks like the modern Sudoku, but smaller.
Actually, Yi Sima was playing it different. First of all, he tried to generate a4×4 board with every row contains 1 to 4, every column contains 1 to 4. Also he made sure that if we cut the board into four 2×2 pieces, every piece contains 1 to 4.
Then, he removed several numbers from the board and gave it to another guy to recover it. As other counselors are not as smart as Yi Sima, Yi Sima always made sure that the board only has one way to recover.
Actually, you are seeing this because you've passed through to the Three-Kingdom Age. You can recover the board to make Yi Sima happy and be promoted. Go and do it!!!
Actually, Yi Sima was playing it different. First of all, he tried to generate a
Then, he removed several numbers from the board and gave it to another guy to recover it. As other counselors are not as smart as Yi Sima, Yi Sima always made sure that the board only has one way to recover.
Actually, you are seeing this because you've passed through to the Three-Kingdom Age. You can recover the board to make Yi Sima happy and be promoted. Go and do it!!!
Input
The first line of the input gives the number of test cases, T(1≤T≤100) . T test cases follow. Each test case starts with an empty line followed by 4 lines. Each line consist of 4 characters. Each character represents the number in the corresponding cell (one of '1', '2', '3', '4'). '*' represents that number was removed by Yi Sima.
It's guaranteed that there will be exactly one way to recover the board.
It's guaranteed that there will be exactly one way to recover the board.
Output
For each test case, output one line containing Case #x:, where x is the test case number (starting from 1). Then output 4 lines with 4 characters each. indicate the recovered board.
Sample Input
3****234141233214*243*312*421*134*41***3*2*414*2*
Sample Output
Case #1:1432234141233214Case #2:1243431234212134Case #3:3412123423414123
代码:
#include<iostream>#include<string>#include<queue>#include<map>#include<set>#include<vector>#include<algorithm>#include<cstdio>#include<cstring>using namespace std;struct node{ int x,y;}pos[80];int row[10][10],col[10][10],ge[4][4][9];char a[10][10];int np=0;int Case=1;void dfs(int d){ if(d==np){ printf("Case #%d:\n",Case++); for(int i=0;i<4;i++){ for(int j=0;j<3;j++){ printf("%c",a[i][j]); } printf("%c\n",a[i][3]); } }else{ int x=pos[d].x,y=pos[d].y; for(int i=1;i<=4;i++){ if(!row[x][i]&&!col[y][i]&&!ge[x/2][y/2][i]){ a[x][y]=i+'0'; row[x][i]=1,col[y][i]=1,ge[x/2][y/2][i]=1; dfs(d+1); row[x][i]=0,col[y][i]=0,ge[x/2][y/2][i]=0; } } }}int main(){ int t=0; //freopen("in.txt","r",stdin); //freopen("out.txt","w",stdout); scanf("%d",&t); while(t--){ np=0; memset(row,0,sizeof(row)); memset(col,0,sizeof(col)); memset(ge,0,sizeof(ge)); for(int i=0;i<4;i++){ for(int j=0;j<4;j++){ scanf(" %c",&a[i][j]); if(a[i][j]=='*') pos[np].x=i,pos[np++].y=j; else{ int num=a[i][j]-'0'; row[i][num]=1; col[j][num]=1; ge[i/2][j/2][num]=1; } } } dfs(0); //if(!flag) printf("impossible\n"); } return 0;}
0 0
- 【DFS】HDU5547Sudoku
- DFS
- DFS
- dfs
- dfs
- dfs
- dfs
- DFS
- DFS
- dfs
- DFS
- DFS
- DFS
- dfs
- DFS
- dfs
- dfs
- dfs
- poj-2342 Anniversary party(树形DP入门)
- MySQL—SQL优化
- Spring中的设计模式-适配器模式
- iOS测试工具和调试技巧以及内测发布平台总结
- 【Hadoop基础教程】Hadoop之单词计数wordcount
- 【DFS】HDU5547Sudoku
- Rxjava的介绍与使用
- leetcode 123. Best Time to Buy and Sell Stock III
- 仿微信联系人分组(右侧索引)
- 游戏底层逻辑,运动&&寻路(四)
- shell 怎么删除文件的最后一行
- 账号问题重新开始
- memcached-session-manager配置
- 最新HoloLens在windows10上的开发配置(1)