Sudoku 数独
来源:互联网 发布:c语言 变量加负号 编辑:程序博客网 时间:2024/05/15 17:46
Sudoku
Time Limit:2000MS Memory Limit:65536KB 64bit IO Format:%lld & %lluDescription
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
submit
思想是一个一个数的开始进行搜索,判断该数是不是在这一列里没出现过,在这一行里没出现过,在对应的小正方形里没出现过,那么这个点就赋值该数
小技巧,知道数的个数(从第一行开始数,数到最后一行的最后一个数),改点的行坐标为n/9,列坐标为n%9,对应的小正方形的最左上角的点的行坐标为n/9/3*3,列坐标为n%9/3*3
AC代码:
#include<iostream>#include<cmath>#include<algorithm>#include<stack>#include<cstring>#include<queue>#include<cstdio>#include<string>using namespace std;int maze[81][81];int ans;int check(int cnt, int num){ int row = cnt / 9; int col = cnt % 9; int i, j; for(i=0; i<9; ++i) { if(maze[row][i] == num || maze[i][col] == num) return 0; } for(i=row/3*3; i<=row/3*3+2; ++i) { for(j=col/3*3; j<=col/3*3+2; ++j) { if((maze[i][j]) == num) return 0; } } return 1;}void dfs(int cnt){ int row = cnt / 9; int col = cnt % 9; if(ans) return; if(cnt == 81) { ans = 1; return; } if(maze[row][col]) { dfs(cnt + 1); return; } int i; for(i=1; i<=9; ++i) { if(check(cnt, i)) { maze[row][col] = i; dfs(cnt + 1); if(ans) return; maze[row][col] = 0; } }}int main(){ int t; scanf("%d", &t); while(t--) { ans = 0; int i, j; for(i=0; i<9; ++i) { for(j=0; j<9; ++j) scanf("%1d", &maze[i][j]); } dfs(0); for(i=0; i<9; ++i) { for(j=0; j<9; ++j) printf("%d", maze[i][j]); printf("\n"); } } return 0;}
0 0
- 谈谈数独(Sudoku)
- 数独(sudoku)实现
- PKU2676 Sudoku 数独
- poj2676 Sudoku 数独
- 数独(sudoku)C++
- POJ2676 Sudoku [数独]
- poj2676 Sudoku 数独
- Sudoku 数独
- 数独Sudoku
- sudoku(数独)
- POJ3074 sudoku数独
- 数独(SuDoku)介绍
- Sudoku Helper 数独助手
- poj 1676 sudoku 数独
- hdu1246 Sudoku Killer 数独
- poj2676(数独 sudoku)
- POJ 2676 Sudoku 数独
- 数独判断 Valid Sudoku
- 使用echarts简单制作省份地图
- NDIS LWF收发3G网卡Mobile Broadband的自定义数据
- jmeter-察看结果树-响应数据,中文显示乱码问题处理
- .so文件找不到的错误
- 用Python做投资-python仿真等价鞅下的收益曲线
- Sudoku 数独
- h264 NAL头解析
- Rxjava(创建类)--Range
- css3 radio 自定义
- 3.HBase的基本操作
- 算法-第四版-练习1.3.23解答
- android studio 混淆
- c++ 构造函数 拷贝构造函数 析构函数 总结
- 2016河南科技学院CSDN高校俱乐部——招新啦