简单九宫格数独

#include<bits/stdc++.h>
#define inf 0x3f3f3f3f
using namespace std;

typedef long long ll;

const int N = 10;

struct node
{
    int x, y, id;
} s[110];

int n = 9;
int top = 0;
int ma[N][N];
int sta[110], tot;
int row[N][N], col[N][N];
int blo[N][N], bloid[N][N];

void dfs(int id)
{
    int x = s[sta[id]].x;
    int y = s[sta[id]].y;
    if(id == tot)
    {
        cout << "-----------------------" << endl;
        for(int i = 0; i < n; i++)
        {
            for(int j = 0; j < n; j++)
            {
                cout << ma[i][j] << " ";
                if(j % 3 == 2) cout << "  ";
            }
            if(i % 3 == 2) cout << endl;
            cout << endl;
        }
        exit(0);
    }
    for(int i = 1; i <= 9; i++)
    {
        if(!row[x][i] && !col[y][i] && !bloid[blo[x][y]][i])
        {
            row[x][i] = col[y][i] = bloid[blo[x][y]][i] = 1;
            ma[x][y] = i;
            dfs(id + 1);
            row[x][i] = col[y][i] = bloid[blo[x][y]][i] = 0;
        }
    }
}

int main()
{
    for(int i = 0; i < n; i++)
    {
        for(int j = 0; j < n; j++)
        {
            blo[i][j] = i / 3 * 3 + j / 3;
//            cout << blo[i][j] << " ";
        }
//        cout << endl;
    }
    for(int i = 0; i < n; i++)
    {
        for(int j = 0; j < n; j++)
        {
            cin >> ma[i][j];
            row[i][ma[i][j]] = 1;
            col[j][ma[i][j]] = 1;
            bloid[blo[i][j]][ma[i][j]] = 1;
            s[top].x = i;
            s[top].y = j;
            s[top].id = top++;
            if(!ma[i][j]) sta[tot++] = s[top - 1].id;
        }
    }
    dfs(0);
    return 0;
}

来源：CSDN

作者：LSlong127

链接：https://blog.csdn.net/qq_44011946/article/details/104117251