请叫我《数独小王子》

来源：互联网发布：zookeeper协调算法编辑：程序博客网时间：2024/05/15 23:13

long long ago I have say :one day,I will accept 数独游戏。

今天在微博上看到一个据说世界上最难的数独，我试着做了下，需要穷枚举。这种问题我是懒得想的，当然交给电脑去做。so lazy啦啦啦。。。然后这个代码就诞生了，妈妈再也不用担心数独游戏不会玩了。

输入是已知的n个数，然后接下来n行有n个数，分别代表他们的位置（x,y），从1-9开始。

#include <cstdio>#include <cstdlib>#include <cstring>#include <algorithm>#include <iostream>#include <cmath>#include <queue>#include <map>#include <stack>#include <list>#include <vector>#include <ctime>#define LL __int64#define eps 1e-8using namespace std;int m[20][20];int find(int x,int y,int z){int x1,x2,y1,y2,i;for (i=1;i<=9;i++){if (m[x][i]==z) return 0;if (m[i][y]==z) return 0;}if (x%3==1){x1=x+1;x2=x+2;}if (x%3==2){x1=x-1;x2=x+1;}if (x%3==0){x1=x-2;x2=x-1;}if (y%3==1){y1=y+1;y2=y+2;}if (y%3==2){y1=y-1;y2=y+1;}if (y%3==0){y1=y-2;y2=y-1;}if (m[x1][y1]==z||m[x1][y2]==z||m[x2][y1]==z||m[x2][y2]==z) return 0;return 1;}int DFS(int x,int y,int gg){int x1,y1,i;if (gg) return gg;if (x==9 && y==9){if (m[9][9]) return gg=1;for (i=1;i<=9;i++){if (find(9,9,i)){m[9][9]=i;return gg=1;}}return 0;}if (m[x][y]){x1=x;y1=y+1;if (y1>9){x1=x+1;y1=1;}gg=DFS(x1,y1,gg);}else{for (i=1;i<=9;i++){int flag=0;if (find(x,y,i)){flag=1;m[x][y]=i;}if (flag){x1=x;y1=y+1;if (y1>9){x1=x+1;y1=1;}gg=DFS(x1,y1,gg);if (!gg) m[x][y]=0;}}}return gg;}int main(){int n,i,x,y,z,j;memset(m,0,sizeof(m));int f=0;char k;while (~scanf("%c",&k)){getchar();if (k=='?') m[1][1]=0;else m[1][1]=k-'0';for (i=1;i<=9;i++){for (i==1?j=2:j=1;j<=9;j++){char k;scanf("%c",&k);getchar();if (k=='?') m[i][j]=0;else m[i][j]=k-'0';}}/*cout<<"****"<<endl;for (i=1;i<=9;i++){for (j=1;j<=9;j++)printf("%d ",m[i][j]);printf("\n");}*/if (f) cout<<endl;f++;int gg=DFS(1,1,0);if (gg){for (i=1;i<=9;i++){for (j=1;j<9;j++)printf("%d ",m[i][j]);printf("%d\n",m[i][9]);}}getchar();}return 0;}

#include <cstdio>#include <cstdlib>#include <cstring>#include <algorithm>#include <iostream>#include <cmath>#include <queue>#include <map>#include <stack>#include <list>#include <vector>#include <ctime>#define LL __int64#define eps 1e-8using namespace std;int m[20][20];int find(int x,int y,int z){int x1,x2,y1,y2,i;for (i=1;i<=9;i++){if (m[x][i]==z) return 0;if (m[i][y]==z) return 0;}if (x%3==1){x1=x+1;x2=x+2;}if (x%3==2){x1=x-1;x2=x+1;}if (x%3==0){x1=x-2;x2=x-1;}if (y%3==1){y1=y+1;y2=y+2;}if (y%3==2){y1=y-1;y2=y+1;}if (y%3==0){y1=y-2;y2=y-1;}if (m[x1][y1]==z||m[x1][y2]==z||m[x2][y1]==z||m[x2][y2]==z) return 0;return 1;}int DFS(int x,int y,int gg){int x1,y1,i;if (gg) return gg;if (x==9 && y==9){if (m[9][9]) return gg=1;for (i=1;i<=9;i++){if (find(9,9,i)){m[9][9]=i;return gg=1;}}return 0;}if (m[x][y]){x1=x;y1=y+1;if (y1>9){x1=x+1;y1=1;}gg=DFS(x1,y1,gg);}else{for (i=1;i<=9;i++){int flag=0;if (find(x,y,i)){flag=1;m[x][y]=i;}if (flag){x1=x;y1=y+1;if (y1>9){x1=x+1;y1=1;}gg=DFS(x1,y1,gg);if (!gg) m[x][y]=0;}}}return gg;}int main(){int n,i,x,y,z,j;scanf("%d",&n);memset(m,0,sizeof(m));for (i=1;i<=n;i++){scanf("%d%d%d",&x,&y,&z);m[x][y]=z;}int gg=DFS(1,1,0);if (gg||!gg){for (i=1;i<=9;i++){for (j=1;j<=9;j++)printf("%d ",m[i][j]);printf("\n");}}return 0;}

0 0