Sudoku-Solver---Backtracking/main.cpp at main · SoftGridAlex/Sudoku-Solver---Backtracking · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
#include <iostream>
#include <fstream>
using namespace std;
int v[1001][1001], n, m;

void afisare(){
    int i, s;
    for(i=1; i<=9; ++i, cout << "\n")
        for(s=1; s<=9; ++s)
            cout << v[i][s] << " ";
}

int validare(int i_nou, int s_nou){
    int i, e, s;
    bool ok=1;
    for(i=1; i<=9; ++i){
        if(v[i_nou][s_nou]==v[i_nou][i] && s_nou!=i)ok=0;
        if(v[i_nou][s_nou]==v[i][s_nou] && i_nou!=i)ok=0;
    }

    int ran_start=((i_nou-1)/3)*3+1;
    int col_start=((s_nou-1)/3)*3+1;

    for(i=ran_start; i<ran_start+3; ++i)
        for(s=col_start; s<col_start+3; ++s)
            if(v[i][s]==v[i_nou][s_nou] && (i!=i_nou || s!=s_nou) )ok=0;

    return ok;
}

void bk(int i_nou, int s_nou){
    int i, i_urm, s_urm;
    if(i_nou>9)afisare();
    if(s_nou==9){
        i_urm=i_nou+1;
        s_urm=1;
    }
    else{
        i_urm=i_nou;
        s_urm=s_nou+1;
    }
    if(v[i_nou][s_nou]==0){
        for(i=1; i<=9; ++i)
        {
            v[i_nou][s_nou]=i;
            if(validare(i_nou, s_nou)){
                bk(i_urm, s_urm);
            }
            v[i_nou][s_nou]=0;
        }
    }
    else bk(i_urm, s_urm);

}

int main()
{
    int i, s;
    for(i=1; i<=9; ++i)
        for(s=1; s<=9; ++s)
            cin >> v[i][s];

    cout << "\n";
    bk(1, 1);

    return 0;
}