搜索--数独
来源:互联网 发布:ubuntu运行lua文件 编辑:程序博客网 时间:2024/05/16 14:40
Sudoku
Time Limit : 4000/2000ms (Java/Other) Memory Limit : 131072/65536K (Java/Other)
Total Submission(s) : 7 Accepted Submission(s) : 6
Special Judge
Problem Description
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
1103000509002109400000704000300502006060000050700803004000401000009205800804000107
Sample Output
143628579572139468986754231391542786468917352725863914237481695619275843854396127题目大概:小时候我们玩的数独游戏,把为零的数填上,横竖都只有一遍1到9,在九宫格内也是。思路:用dfs搜索,一个空一个空的填,注意判断能够填上的条件又是那个,横,竖,九宫格。代码:#include <iostream>#include <string>using namespace std;int a[10][10];int f=0;int che(int x,int y,int k){for(int i=1;i<=9;i++){ if(a[x][i]==k)return 0;}for(int i=1;i<=9;i++){ if(a[i][y]==k)return 0;}for(int i=(x-1)/3*3+1;i<=(x-1)/3*3+3;i++){ for(int j=(y-1)/3*3+1;j<=(y-1)/3*3+3;j++) { if(a[i][j]==k)return 0; }} return 1;}int print(){for(int i=1;i<=9;i++){ for(int j=1;j<=9;j++) { cout<<a[i][j]; } cout<<endl;}return 0;}int dfs(int x,int y){ if(x==10&&y==1){print(); f=1;} if(f)return 0; if(a[x][y]!=0){if(y==9)dfs(x+1,1); else dfs(x,y+1);} else { for(int i=1;i<=9;i++) { if(che(x,y,i)){ a[x][y]=i;if(y==9)dfs(x+1,1); else dfs(x,y+1);if(f)return 0;a[x][y]=0;} } } return 0;}int main(){int t;cin>>t;for(int i=1;i<=t;i++){string s;f=0;for(int j=1;j<=9;j++){ cin>>s; for(int k=0;k<9;k++) { a[j][k+1]=s[k]-48; }}dfs(1,1);} return 0;}
阅读全文
0 0
- 搜索函数 数独
- 数独 (搜索)
- 搜索--数独
- 数独 搜索
- HDU-1426 数独 搜索
- HDU1426 数独游戏 搜索
- POJ 2676 数独 搜索
- nyoj 722 数独 搜索
- POJ 2676 Sudoku (数独 搜索)
- 验证数独(深度搜索)
- POJ 2676 数独(基础搜索)
- codevs2924数独挑战 深度优先搜索
- 蓝桥杯 数独 深度优先搜索
- POJ_2676:数独问题-DFS暴力搜索
- 搜索 --- 数独求解 POJ 2676 Sudoku
- “数独”游戏-Java-dfs搜索算法
- 简单搜索(数独)poj 2676 Sudoku
- poj2676--Sudoku(搜索练习5-数独游戏)
- 构建Docker私有仓库
- 一个for循环输出九九乘法口诀表
- CSAPP 第三、五、六、七章
- 基本数据的自动类型转换和强制类型转换
- unable to load class for jsp
- 搜索--数独
- C/C++ register关键字学习
- RedHat6.5安装zookeeper单机
- RedHat6.5安装zookeeper集群
- 【BigHereo 1】-----对MQ的一些思考(一)
- docker:一个container映射多个端口到Host
- Catch That Cow
- 自定义View
- CSAPP 第八、九章