数独

#include <stdio.h> 
#include <string.h> 
int map[9][9]; 
bool row[9][10]; 
bool col[9][10]; 
bool block[3][3][10]; 
bool flag;
void DFS(int x)
{
	if(flag)
		return;
	int r = x / 9;
	int c = x % 9;
	int i, j;
	if(81 == x)
	{
		for(i = 0; i < 9; i++)
		{
			for(j = 0; j < 9; j++)
				printf("%d ", map[i][j]);
			printf("\n");
		}
		flag = 1;
		return;
	}
	if(0 == map[r][c])
	{
		for(i = 1; i <= 9; i++)
		{
			if(!(row[r][i] || col[c][i] || block[r / 3][c / 3][i]))
			{
				map[r][c] = i;
				row[r][i] = col[c][i] = block[r / 3][c / 3][i] = 1;
				DFS(x + 1);
				row[r][i] = col[c][i] = block[r / 3][c / 3][i] = 0;
				map[r][c] = 0;
			}
		}
	}
	else
		DFS(x + 1);
}
int main()
{
	int i, j, n;
	scanf("%d", &n);
	while(n--)
	{
		flag = 0;
		memset(row, 0, sizeof(row));
		memset(col, 0, sizeof(col));
		memset(block, 0, sizeof(block));
		for(i = 0; i < 9; i++)
		{
			for(j = 0; j < 9; j++)
			{
				scanf("%d", &map[i][j]);  //输入9*9矩阵 
				if(map[i][j])
				{
					row[i][map[i][j]] = 1;
					col[j][map[i][j]] = 1;
					block[i/3][j/3][map[i][j]] = 1;
				}
			}
		}
		DFS(0);
	}
	return 0;
}