HDU-1426 数独 搜索

http://acm.hdu.edu.cn/showproblem.php?pid=1426

全暴力 注意输入格式比较坑

#include<stdio.h>
#include<iostream>
#include<string.h>
#include<vector>
#include<algorithm>
using namespace std;
const int maxn = 15;
const int inf = 1<<30;
int pos;
int map[maxn][maxn];

struct Node
{
	int x,y;
}node[9*9];
bool check(int cnt,int x,int y )//判断所填的数是否合法 k为准备要填的数，cur为要填的位置在q中的编号
{
     for( int i = 1; i <= 9; i ++ )
     {
         if( map[x][i] == cnt || map[i][y] == cnt )
			 return 0;//判断行和列是否用过k
     }
     int xx = (x-1)/3*3 + 1;
     int yy = (y-1)/3*3 + 1;
     for( int i = xx; i < xx+3; i ++ )
	 {
		 for( int j = yy; j < yy+3; j ++ )
			 if( map[i][j] == cnt )
				 return 0;				
	 }
     return 1;
}
int DFS( int k )
{
	if( k == pos+1 )
	{
		return 1;
	}
	int x = node[k].x;
	int y = node[k].y;
	bool vis[10];
	memset( vis,0,sizeof(vis) );
	for( int i = 1; i <= 9; i ++ )
	{
		if( map[x][i] != -1 )
			vis[map[x][i]] = true;
		if( map[i][y] != -1 )
			vis[map[i][y]] = true;
	}
	int xx = (x-1)/3*3 + 1;
	int yy = (y-1)/3*3 + 1;
	for( int i = xx; i < xx+3; i ++ )
	{
		for( int j = yy; j < yy+3; j ++ )
			if( map[i][j] != -1 )
				vis[map[i][j]] = true;
	}
	
	for( int i = 1; i <= 9; i ++ )
	{
		if( !vis[i] )
		{
			map[x][y] = i;
			if( DFS( k+1 ) )
				return 1;
			map[x][y] = -1;
		}
	}
	return 0;
}
int main()
{
	//freopen("data.txt","r",stdin);
	int ff = 0;
	char ch;
    while( cin>>ch )
	{
		pos = 0;
		for( int i = 1; i <= 9; i ++ )
		{
			for( int j = 1; j <= 9; j ++ )
			{
				if( i*j != 1 )
					cin>>ch;
				if( ch == '?' )
				{
					map[i][j] = -1;
					node[++pos].x = i;
					node[pos].y = j;
				}
				else
					map[i][j] = ch-'0';
			}
		}
		DFS( 1 );
		if( ff )
			puts("");
		for( int i = 1; i <= 9; i ++ )
		{
			for( int j = 1; j <= 9; j ++ )
			{
				 if( j == 1 )  
                    printf("%d",map[i][j]);  
                else  
                    printf(" %d",map[i][j]);  

			}
			puts("");
		}
		ff = 1;
	}
    return 0;
}