-
Notifications
You must be signed in to change notification settings - Fork 0
/
Sudokuv1.cpp
102 lines (72 loc) · 1.44 KB
/
Sudokuv1.cpp
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
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
void printSoduko(vector<vector<int>>&);
bool fillSoduko(vector<vector<int>>& v){
for(int i=0;i<9;i++){
for(int j=0;j<9;j++){
if(v[i][j] == -1){
vector<bool> possible(10,true);
for(int k=0;k<9;k++){
if(v[i][k] != -1){
possible[v[i][k]] = false;
}
}
for(int k=0;k<9;k++){
if(v[k][j] != -1){
possible[v[k][j]] = false;
}
}
int row = i/3;
int col = j/3;
row *= 3;
col *= 3;
for(int k=0;k<3;k++){
for(int w=0;w<3;w++){
if(v[row+k][col+w] != -1){
possible[v[row+k][col+w]] = false;
}
}
}
int c = count(possible.begin(),possible.end(),true);
if(c == 1){
return false;
}
for(int k=1;k<10;k++){
if(possible[k]){
v[i][j] = k;
bool b = fillSoduko(v);
//printSoduko(v);
if(b){
return b;
}else{
v[i][j] = -1;
}
}
}
}
}
}
return true;
}
void printSoduko(vector<vector<int>>& v){
for(int i=0;i<9;i++){
for(int j=0;j<9;j++){
cout << v[i][j] << " ";
}
cout << endl;
}
cout << endl;
}
int main(){
vector<vector<int>> v(9,vector<int>(9,-1));
for(int i=0;i<9;i++){
for(int j=0;j<9;j++){
cin >> v[i][j];
}
}
fillSoduko(v);
printSoduko(v);
return 0;
}