Problem-Solving/2239.cpp at master · Eastplanet/Problem-Solving · 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
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
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<cstring>
#include <string>

using namespace std;

int arr[9][9];

vector<int> getAbleMin(int x, int y) {
	int visited[10] = {};
	int tempx, tempy;
	tempx = x / 3;
	tempy = y / 3;
	int xpos = 0, ypos = 0;
	vector<int> vec;
	xpos += 3 * tempx;
	ypos += 3 * tempy;

	for (int i = 0; i < 3; i++) {
		for (int j = 0; j < 3; j++) {
			int val = arr[i + ypos][j + xpos];
			visited[val] = 1;
		}
	}

	for (int i = 0; i < 9; i++) {
		int val = arr[y][i];
		visited[val] = 1;
		val = arr[i][x];
		visited[val] = 1;
	}

	for (int i = 1; i < 10; i++) {
		if (visited[i] == 0)vec.push_back(i);
	}

	return vec;

}


bool canInsert(int x, int y, int num) {
	int visited[10] = {};
	x = x / 3;
	y = y / 3;
	int xpos = 0, ypos = 0;
	xpos += 3 * x;
	ypos += 3 * y;

	for (int i = 0; i < 3; i++) {
		for (int j = 0; j < 3; j++) {
			int val = arr[i + ypos][j + xpos];
			visited[val] = 1;
		}
	}

	for (int i = 0; i < 9; i++) {
		int val = arr[ypos][i];
		visited[val] = 1;
		val = arr[i][xpos];
		visited[val] = 1;
	}


	if (visited[num] == 1)return false;
	return true;


}

void sudoku() {


	int flag = 1;
	for (int i = 0; i < 9; i++) {
		for (int j = 0; j < 9; j++) {
			if (arr[i][j] == 0) {
				flag = 0;
				vector<int> vec = getAbleMin(j, i);

				for (int k = 0; k < vec.size(); k++) {
					arr[i][j] = vec[k];
					sudoku();
					arr[i][j] = 0;
				}

				return;
			}
		}
	}

	if (flag) {
		for (int i = 0; i < 9; i++) {
			for (int j = 0; j < 9; j++) {
				cout << arr[i][j];
			}
			cout << "\n";
		}
		exit(0);
	}
}


int main(void)

{
	ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);

	for (int i = 0; i < 9; i++) {
		string temp; cin >> temp;

		for (int j = 0; j < 9; j++) {
			arr[i][j] = temp[j] - '0';
		}
	}

	sudoku();


}