Sudoku

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

问题描述

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!!!

Input

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.

Output

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.

问题分析

问题大意是 四宫格填数，填入（1-4）。
本题和我之前写的一道九宫格数独题目十分类似，直接用dfs即可，稍微注意一下剪枝条件。

AC代码

/*
author:Manson
date:8.18.2018
theme:
*/
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 5;
char s[N][N];
int mp[N][N];
int num;
struct node{
    int x;
    int y;
}a[25];
//判断填数
int judge(int k,int cur){
    for(int i = 0;i < 4;i++){
        if(mp[a[cur].x][i] == k || mp[i][a[cur].y] == k){
            return 0;
        }
    }
    int r = a[cur].x/2*2,c = a[cur].y / 2 * 2;
    for(int i = r;i <= r+1;i++){
        for(int j = c;j <= c+1;j++){
            if(mp[i][j] == k){
                return 0;
            }
        }
    }
    return 1;
}
//cur为需要填空的数量 
void dfs(int cur){
    int i,j,flag = 0;
    if(cur == num){
        for(int i = 0;i < 4;i++){
            for(int j = 0;j < 4;j++){
                cout<<mp[i][j];
            }
            cout<<endl;
        }
        flag = 1;
        return;
    }
    if(flag){
        return;
    }
    for(int i = 1;i <= 4;i++){
        if(judge(i,cur) && !flag){
            mp[a[cur].x][a[cur].y] = i;
            dfs(cur+1);
            mp[a[cur].x][a[cur].y] = 0;
        }
    }
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    int cnt = 1;
    int t;
    cin>>t;
    while(t--){
        num = 0;
        for(int i = 0;i < 4;i++){
            for(int j = 0;j < 4;j++){
                cin>>s[i][j];
                if(s[i][j] == '*'){
                    mp[i][j] = 0;
                    a[num].x = i;
                    a[num].y = j;
                    num++;
                }
                else{
                    mp[i][j] = s[i][j] - '0';
                }
            }
        }
        cout<<"Case #"<<cnt++<<":"<<endl;
        dfs(0);
    }
    return 0;
}