2924 数独挑战

 1 #include<cstring>
 2 #include<iostream>
 3 using namespace std;
 4 
 5 int map[15][15];
 6 int group[15][15];
 7 int h[15][15];
 8 int z[15][15];
 9 int x[15][15];
10 bool flag=true;
11 void chu()
12 {
13     int a=1;
14     for(int i=1; i<=9; ++i)
15     {
16         if(i>3&&i<=6)a=4;
17         else if(i>6)a=7;
18         for(int j=1; j<=9; ++j)
19         {
20             if(j<=3)group[i][j]=a;
21             else if(j>3&&j<=6)group[i][j]=a+1;
22             else if(j>6)group[i][j]=a+2;
23         }
24     }
25 }
26 void print()
27 {
28     for(int i=1; i<=9; ++i)
29     {
30         for(int j=1; j<=9; ++j)
31             cout<<map[i][j]<<" ";
32         cout<<endl;
33     }
34     flag=false ;
35 }
36 void search(int a,int b)
37 {
38     if(flag==false)return ;
39     if(map[a][b]!=0)
40     {
41         if(a==9&&b==9)print();
42         if(b==9) search(a+1,1);else search(a,b+1);
43     }
44     if(map[a][b]==0)
45     {
46         for(int i=1; i<=9; ++i)
47         {
48             if(h[a][i]==0 && z[b][i]==0 && x[group[a][b]][i]==0)
49             {
50                 map[a][b]=i;
51                 h[a][i]=1;
52                 z[b][i]=1;
53                 x[group[a][b]][i]=1;
54                 if(a==9&&b==9)print();
55                 if(b<9)search(a,b+1);
56                 else search(a+1,1);
57                 map[a][b]=0;
58                 h[a][i]=0;
59                 z[b][i]=0;
60                 x[group[a][b]][i]=0;
61             }
62         }
63         
64     }
65     
66 }
67 int main()
68 {
69     chu();
70     memset(map,0,sizeof(map));
71     for(int i=1; i<=9; ++i)
72     {
73         for(int a,j=1; j<=9; ++j)
74         {
75             cin>>a;
76             map[i][j]=a;
77             if(a>0)
78             {
79                 h[i][a]=1;
80                 z[j][a]=1;
81                 x[group[i][j]][a]=1;
82             }
83         }
84     }
85     search(1,1);
86     return 0;
87 }