Sudoku 递归

Sudoku 递归

Time limit：1000 ms Memory limit：65535 kB Source: The 2015 China Collegiate Programming Contest

描述

Yi Sima was one of the best counselors of Cao Cao. He likes to play a funny game himself. It looks like the modern Sudoku, but smaller.

Actually, Yi Sima was playing it different. First of all, he tried to generate a 4×4 board with every row contains 1 to 4, every column contains 1 to 4. Also he made sure that if we cut the board into four 2×2 pieces, every piece contains 1 to 4.

Then, he removed several numbers from the board and gave it to another guy to recover it. As other counselors are not as smart as Yi Sima, Yi Sima always made sure that the board only has one way to recover.

Actually, you are seeing this because you’ve passed through to the Three-Kingdom Age. You can recover the board to make Yi Sima happy and be promoted. Go and do it!!!

输入

The first line of the input gives the number of test cases, T(1≤T≤100). T test cases follow. Each test case starts with an empty line followed by 4 lines. Each line consist of 4 characters. Each character represents the number in the corresponding cell (one of ‘1’, ‘2’, ‘3’, ‘4’). ‘*’ represents that number was removed by Yi Sima.

It’s guaranteed that there will be exactly one way to recover the board.

输出

For each test case, output one line containing Case #x:, where x is the test case number (starting from 1). Then output 4 lines with 4 characters each. indicate the recovered board.

Input

3
****
2341
4123
3214
*243
*312
*421
*134
*41*
**3*
2*41
4*2*

Output

Case #1:
1432
2341
4123
3214
Case #2:
1243
4312
3421
2134
Case #3:
3412
1234
2341
4123

代码

#include <bits/stdc++.h>

#define PI 3.14159265358979383246
#define LL long long
#define INF 0x3f3f3f3f  

#define _for(i, a) for(int i = 0; i < (a); ++i)
#define _rep(i, a, b) for(int i = (a); i < (b); ++i)
#define _forit(a, b) for(a::iterator it = b.begin(); it != b.end(); it++)


using namespace std;

bool dfs[4][4];
char a[4][5];//存储数独数组
int deep = 0;//递归深度

bool arr(int i, int j) {
	deep++;
	if (i == 3 && j == 4) return true;
	if (j == 4) i++, j = 0;//转化i，j的值为坐标
	if (dfs[i][j]) return arr(i, j + 1);//如果为旧点就继续深搜
	dfs[i][j] = true;//把当前位置标记为旧点
	for (char c = '1'; c <= '4'; c++) {
		  判断填入c是否合理
		if (a[i][0] == c || a[i][1] == c || a[i][2] == c || a[i][3] == c) continue;//检查i所在的一行
		if (a[0][j] == c || a[1][j] == c || a[2][j] == c || a[3][j] == c) continue;//检查j所在的一列
		int ti = i / 2 * 2;
		int tj = j / 2 * 2;
		if (a[ti][tj] == c || a[ti + 1][tj] == c || a[ti][tj + 1] == c || a[ti + 1][tj + 1] == c) continue;//检查当前所在的小方块
		
		a[i][j] = c;
		if (arr(i, j + 1)) { deep--; return true; }
	}
	dfs[i][j] = false;
	a[i][j] = '*';
	deep--; return false;
}

int main()
{
	//freopen("input.txt", "r", stdin);
	int n = 0;
	cin >> n;
	_for(q, n) {
		_for(i, 4) cin >> a[i];
		///数出一共需要填入多少数
		_for(i, 4)
			_for(j, 4)
			if (a[i][j] == '*') dfs[i][j] = false;
			else dfs[i][j] = true;
		///
		printf("Case #%d:\n", q + 1);
		arr(0, 0);
		_for(i, 4) cout << a[i] << endl;//输出结果
	}
	return 0;
}

本人也是新手，也是在学习中，勿喷

转载请注明出处

欢迎有问题的小伙伴一起交流哦~