Sudoku POJ
来源:互联网 发布:读写器软件 编辑:程序博客网 时间:2024/05/30 05:41
Sudoku
POJ - 2676Sudoku 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.
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.
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.
1103000509002109400000704000300502006060000050700803004000401000009205800804000107
143628579572139468986754231391542786468917352725863914237481695619275843854396127
代码:
#include<stdio.h>#include<string.h>int mp[10][10],a[85][3],b[10][10],c[10][10];int prime(int i,int j,int k){ int p,q; for(p=i/3*3;p<=i/3*3+2;p++) for(q=j/3*3;q<=j/3*3+2;q++) if(mp[p][q]==k) return 0; return 1;}int cmp(int w){ int i,j,k; j=a[w][0],k=a[w][1]; if(w<0) return 1; for(i=0;i<9;i++) { if(prime(j,k,i+1)&&!b[j][i]&&!c[k][i]) { b[j][i]=c[k][i]=1; mp[j][k]=i+1; if(cmp(w-1)) return 1; b[j][i]=c[k][i]=0; mp[j][k]=0; } } return 0;}int main(){ int i,j,t,w; char s[10]; scanf("%d",&t); while(t--) { memset(b,0,sizeof(b)); memset(c,0,sizeof(c)); w=0; for(i=0;i<9;i++) { scanf("%s",s); for(j=0;j<9;j++) { mp[i][j]=s[j]-'0'; if(!mp[i][j]) { a[w][0]=i; a[w][1]=j; w++; } if(mp[i][j]) b[i][mp[i][j]-1]=1; } } for(j=0;j<9;j++) for(i=0;i<9;i++) if(mp[i][j]) c[j][mp[i][j]-1]=1; cmp(w-1); for(i=0;i<9;i++) { for(j=0;j<9;j++) printf("%d",mp[i][j]); printf("\n"); } } return 0;}
阅读全文
0 0
- poj Sudoku
- Sudoku POJ
- poj 2676 Sudoku
- POJ 2676 Sudoku
- poj 3074 Sudoku
- POJ 2676 Sudoku dfs
- Poj 2676 Sudoku
- POJ 3074 Sudoku DLX
- POJ 3067 Sudoku DLX
- POJ 2676 Sudoku [暴搜]
- POJ 2676 Sudoku
- POJ 2676 Sudoku
- POJ 2676 Sudoku
- POJ 2676 Sudoku
- POJ 2676 Sudoku
- POJ 2676—Sudoku
- POJ-2676-Sudoku
- poj 2676 Sudoku
- Count the string kmp next数组应用
- 学习记录--颤抖吧,hadoop(四)---安装Linux系统
- 20170816_new和delete的使用
- NULL和0的区别
- 区块链(三)--常用命令(2)
- Sudoku POJ
- poj1195二维线段树,区间求和,单点跟新
- 手欠--Executioin failed for task 的问题
- jsp笔记——内置对象
- 小白学分布式程序开发11-PAXOS算法1
- ZOJ 2006 Glass Beads
- 嗨!我的第一篇博客
- python metaclass 和 __new__方法
- apache