Sudoku(DFS)
来源:互联网 发布:php5.4 连接数据库 编辑:程序博客网 时间:2024/06/05 09:37
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
思路:我是直接暴力做的,一开始从左上角开始搜结果T了,改成右下角开始搜就AC了。。。代码写得很凌乱,等知道到怎么优化了再来改吧。
#include <stdio.h>int a[9][9];bool end;void search(int x,int y){ int i,j,k,p,q,flag; if(y==-1) { x--; y=8; } if(!end && x==-1 && y==8) { for(i=0;i<9;i++) { for(j=0;j<9;j++) { printf("%d",a[i][j]); } printf("\n"); } end=1; } else if(!end && !a[x][y]) { for(k=1;k<=9;k++) { flag=1; for(i=0;i<9;i++)//判断行列有没有k { if(a[x][i]==k) {flag=0;break;} if(a[i][y]==k) {flag=0;break;} } p=x/3*3; q=y/3*3; for(i=0;i<3;i++)//判断宫内有没有k { for(j=0;j<3;j++) { if(a[p+i][q+j]==k) {flag=0;break;} } } if(!flag) continue; a[x][y]=k; search(x,y-1); a[x][y]=0; } } else if(!end && a[x][y]) search(x,y-1);}int main(){ int i,j,t; scanf("%d",&t); while(t--) { for(i=0;i<9;i++) { for(j=0;j<9;j++) { scanf("%1d",&a[i][j]); } } end=0; search(8,8); } return 0;}
45 0
- Sudoku(DFS)
- Sudoku--DFS
- Sudoku(DFS)
- PKU 2676 (Sudoku) DFS
- POJ 2676 Sudoku dfs
- 【DFS】ZOJ 1580 Sudoku
- POJ2676:Sudoku(DFS)
- ZOJ 2580 Sudoku (DFS)
- hdu1426 Sudoku Killer dfs
- poj 2676 sudoku(DFS)
- Leetcode dfs Sudoku Solver
- POJ2676:Sudoku(DFS)
- POJ 2676 sudoku dfs
- POJ 2676 SuDoKu DFS
- C - Sudoku+dfs
- POJ2676 Sudoku DFS
- POJ-2627-Sudoku-DFS
- POJ-2676-Sudoku-DFS
- [CTCI] 5.2 Convert Decimal to Binary
- Ubuntu下为Firefox安装Adobe Flash Player
- Microsoft Visual C++ Runtime Library 如何解决?
- redis 学习篇(基础)
- bug和debug的由来,挺有意思
- Sudoku(DFS)
- WaitableTimer与SetTimer的区别
- Cocos2d lua
- android之Http协议编程01
- 我的2013
- leetcode:Next Permutation
- 初来乍到二三事@UK
- 比特币原理
- 网络编程之基于TCP协议的网络编程