数独问题(DFS回溯)
2015-08-25 09:57
302 查看
Sudoku is a very simple task. A square table with 9 rows and 9 columns is divided to 9 smaller squares 3x3 as shown on the Figure. In some of the cells are written decimal digits from 1 to 9. The other cells are empty. The goal is to fill the empty cells with decimal digits from 1 to 9, one digit per cell, in such way that in each row, in each column and in each marked 3x3 subsquare, all the digits from 1 to 9 to appear. Write a program to solve a given Sudoku-task.
Input
The input data will start with the number of the test cases. For each test case, 9 lines follow, corresponding to the rows of the table. On each line a string of exactly 9 decimal digits is given, corresponding to the cells in this line. If a cell is empty it is represented by 0.
Output
For each test case your program should print the solution in the same format as the input data. The empty cells have to be filled according to the rules. If solutions is not unique, then the program may print any one of them.
Sample Input
Sample Output
View Code
Input
The input data will start with the number of the test cases. For each test case, 9 lines follow, corresponding to the rows of the table. On each line a string of exactly 9 decimal digits is given, corresponding to the cells in this line. If a cell is empty it is represented by 0.
Output
For each test case your program should print the solution in the same format as the input data. The empty cells have to be filled according to the rules. If solutions is not unique, then the program may print any one of them.
Sample Input
1 103000509 002109400 000704000 300502006 060000050 700803004 000401000 009205800 804000107
Sample Output
143628579 572139468 986754231 391542786 468917352 725863914 237481695 619275843 854396127
//Memory Time //184K 422MS #include<iostream> using namespace std; int map[10][10]; //九宫格 bool row[10][10]; //row[i][x] 标记在第i行中数字x是否出现了 bool col[10][10]; //col[j][y] 标记在第j列中数字y是否出现了 bool grid[10][10]; //grid[k][x] 标记在第k个3*3子格中数字z是否出现了 //(这里说明的字母不代表下面程序中的变量) bool DFS(int x,int y) { if(x==10) return true; bool flag=false; if(map[x][y]) { if(y==9) flag=DFS(x+1,1); else flag=DFS(x,y+1); if(flag) //回溯 return true; else return false; } else { int k=3*((x-1)/3)+(y-1)/3+1; for(int i=1;i<=9;i++) //枚举数字1~9填空 if(!row[x][i] && !col[y][i] && !grid[k][i]) { map[x][y]=i; row[x][i]=true; col[y][i]=true; grid[k][i]=true; if(y==9) flag=DFS(x+1,1); else flag=DFS(x,y+1); if(!flag) //回溯,继续枚举 { map[x][y]=0; row[x][i]=false; col[y][i]=false; grid[k][i]=false; } else return true; } } return false; } int main(int i,int j) { int test; cin>>test; while(test--) { /*Initial*/ memset(row,false,sizeof(row)); memset(col,false,sizeof(col)); memset(grid,false,sizeof(grid)); /*Input*/ char MAP[10][10]; for(i=1;i<=9;i++) for(j=1;j<=9;j++) { cin>>MAP[i][j]; map[i][j]=MAP[i][j]-'0'; if(map[i][j]) { int k=3*((i-1)/3)+(j-1)/3+1; row[i][ map[i][j] ]=true; col[j][ map[i][j] ]=true; grid[k][ map[i][j] ]=true; } } /*Fill the Sudoku*/ DFS(1,1); for(i=1;i<=9;i++) { for(j=1;j<=9;j++) cout<<map[i][j]; cout<<endl; } } return 0; }
View Code
相关文章推荐
- 把一个完全图分成两部分
- BFS(两个水杯转换水量)
- 洗牌问题(模拟)
- BFS(从数字A变到数字B每次只能换一个数)
- BFS(数字a通过三种操作到数字B)
- dfs+bfs(三种路径问题)
- 国际象棋跳马问题
- pch中常用的一些宏和根据rgb取色设置
- Vijos P1023Victoria的舞会3【贪心+DFS求强联通分量】
- 程序员最该看的30本书---------------------------国外编辑推荐
- (转载),方便使用http://www.cocoachina.com/bbs/read.php?tid=128244
- ACM学习历程—HDU1584 蜘蛛牌(动态规划 && 状态压缩 || 区间DP)
- 拓扑排序
- SVN安装问题The Apache Portable Runtime (APR) library cannot be found
- prim+BFS
- 最小生成树
- 最小生成树(修路)
- UGUI(四)事件系统的封装
- floyd算法汇率
- jquery实现在网页指定区域显示自定义右键菜单效果