Sudoku（简单DFS）

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=5547

数据比较少,直接暴力DFS,检验成立情况即可

AC代码：但是不知道为什么用scanf,printf输入输出就WA了

 /* */
 # include <iostream>
 # include <stdio.h>
 # include <string.h>
 # include <cstdlib>
 # include <cmath>
 # include <climits>
 # include <deque>
 # include <queue>
 # include <stack>
 # include <vector>
 # include <map>
 # include <set>
 # include <ctime>
 # include <functional>
 using namespace std;
 typedef long long ll;
 const int inf=0x3f3f3f3f;
 const int maxn=5e4+;
 const ll mod=1e9+;
 char ma[][];
 int vis[];
 int p[][];
 int tx[];
 int ty[];
 int flag, tot;

 int check()
 {
     for(int i=; i<; i++ )///检查每一行
     {
         vis[]=vis[]=vis[]=vis[]=;
         for(int j=; j<; j++ )
         {
             if( p[i][j]== )
                 continue;
             if( vis[p[i][j]] )///填的数重复了不成立
                 return ;
             vis[p[i][j]] = ;
         }
     }

     for(int j=; j<; j++ )///检查每一列
     {
         vis[]=vis[]=vis[]=vis[]=;
         for(int i=; i<; i++ )
         {
             if( p[i][j]== )
                 continue;
             if( vis[p[i][j]] )
                 return ;
                 vis[p[i][j]] = ;
         }
     }

     vis[] = vis[] = vis[] = vis[] = ;
     for(int i=; i<; i++ )///检查左上角的1/4方块
     {
         for(int j=; j<; j++ )
         {
             if( p[i][j]== )
                 continue;
             if( vis[p[i][j]] )
                 return ;
             vis[p[i][j]] = ;
         }
     }

     vis[]=vis[]=vis[]=vis[]=;
     for(int i=; i<; i++ )///检查右上角的1/4块
     {
         for(int j=; j<; j++ )
         {
             if( p[i][j]== )
                 continue;
             if( vis[p[i][j]] )
                 return ;
             vis[p[i][j]] = ;
         }
     }

     vis[] = vis[] = vis[] = vis[]=;
     for(int i=; i<; i++ )///检查左下角1/4块
     {
         for(int j=; j<; j++ )
         {
             if( p[i][j]== )
                 continue;
             if( vis[p[i][j]] )
                 return ;
             vis[p[i][j]] = ;
         }
     }

     vis[] = vis[] = vis[] = vis[] = ;
     for(int i=; i<; i++ )///检查右下角1/4块
     {
         for(int j=; j<; j++ )
         {
             if( p[i][j]== )
                 continue;
             if( vis[p[i][j]] )
                 return ;
             vis[p[i][j]] = ;
         }
     }
     return ;
 }

 void dfs(int x)
 {
     if( flag )
         return ;
     if( x==tot )
     {
         for(int i=; i<; i++ )
         {
             for(int j=; j<; j++ )
             {
                 cout<<p[i][j];
                 //printf("%d", p[i][j]);
             }
             cout<<endl;
             //printf("\n");
         }
         flag=;
         return ;
     }

     for(int i=; i<=; i++ )
     {
         p[tx[x]][ty[x]]=i;
         if( check())
         {
             dfs(x+);
         }
         p[tx[x]][ty[x]] = ;
     }
 }

 int main()
 {
     int t;
     scanf("%d", &t);
     int k=;
     //getchar();
     while( t-- )
     {
         for(int i=; i<; i++ )
         {
             for(int j=; j<; j++ )
             {
                 cin>>ma[i][j];
                 //scanf("%c", &ma[i][j]);
             }
             //getchar();
         }

         for(int i=; i<; i++ )
         {
             for(int j=; j<; j++ )
             {
                 if( ma[i][j]=='*' )
                 {
                     p[i][j] = ;
                 }
                 else
                     p[i][j] = ma[i][j] - '';
             }
         }

         flag=;
         tot = ;
         for(int i=; i<; i++ )
         {
             for(int j=; j<; j++ )
             {
                 if( !p[i][j] )
                 {
                     /*依次记录空节点的坐标*/
                     tx[tot] = i;
                     ty[tot] = j;
                     tot++;
                 }
             }
         }
         printf("Case #%d:\n", k++);
         dfs();
     }
     return ;
 }