-
Notifications
You must be signed in to change notification settings - Fork 0
/
solve1.0.cpp
206 lines (206 loc) · 4.54 KB
/
solve1.0.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
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
#include<cstdio>
#include<cstring>
#include<iostream>
#include<ctime>
#include<algorithm>
#include<Windows.h>
#include<Mmsystem.h>
using namespace std;
char first_line[10] = { 4,1,2,3,5,6,7,8,9 };
unsigned int shift[9] = { 0,6,12,2,8,14,4,10,16 };
unsigned int permutation_change1[6][3] = { { 3,4,5 },{ 3,5,4 },{ 4,3,5 },{ 4,5,3 },{ 5,3,4 },{ 5,4,3 } };
unsigned int permutation_change2[6][3] = { { 6,7,8 },{ 6,8,7 },{ 7,6,8 },{ 7,8,6 },{ 8,6,7 },{ 8,7,6 } };
char mp[10][20];
unsigned int cnt;
unsigned int n;
FILE *res;
bool falg_gene;
char visit_squard[3][3][11] = { 0 };
char visit_row[18][11] = { 0 };
char visit_col[18][11] = { 0 };
char init_exist[18][18] = { 0 };
bool flag;
bool flag_blank;
int total = 0;
bool judge(char row, char col, char num) {
if (visit_row[row][num] ||
visit_col[col][num] ||
visit_squard[row / 3][col / 6][num]) {
return 0;
}
/*int a, c, b;
if (visit_row[row][num]) a = 1;
else a = 0;
if (visit_col[col][num]) b = 1;
else b = 0;
if (visit_squard[row / 3][col / 6][num]) c = 1;
else c = 0;
if (a || b || c) return 0;*/
return 1;
}
void solve(unsigned int cur_cnt)
{
if (cur_cnt == 162) {
flag = 1;
}
if (flag) {
return;
}
char row = cur_cnt / 18;
char col = cur_cnt % 18;
if (init_exist[row][col]) {
solve(cur_cnt + 2);
}
else{
for (unsigned int i = 1;i <= 9;i++) {
if (flag) {
return;
}
if (judge(row, col, i)) {
mp[row][col] = i;
visit_row[row][i] = 1;
visit_col[col][i] = 1;
visit_squard[row / 3][col / 6][i] = 1;
solve(cur_cnt + 2);
visit_row[row][i] = 0;
visit_col[col][i] = 0;
visit_squard[row / 3][col / 6][i] = 0;
}
}
}
}
void print_res()
{
for (int i = 0;i < 9;i++) {
for (int j = 0;j < 18;j += 2) {
mp[i][j] += '0';
}
}
for (int i = 0;i < 8;i++) {
fputs(mp[i], res);
fputc('\n', res);
}
fputs(mp[8], res);
}
void init()
{
cnt = 0;
flag_blank = 0;
res = fopen("sudokures.txt", "w+");
//freopen("out.txt", "w+", stdout);
for (int row = 0;row < 9;row++) {
for (int col = 0;col < 17;col++) {
mp[row][col] = ' ';
mp[row][17] = '\0';
}
}
}
int main()
{
//FILE* input = fopen("in.txt", "r");
FILE* input = fopen("problem.txt", "r");
init();
if (input == NULL) {
printf("Reading input error!\n");
return 0;
}
unsigned int cnt_num = 0;
unsigned int pos = 0;
unsigned int cur;
while (fscanf(input, "%d", &cur) != EOF) {
int pos = 0;
char row = pos / 18;
char col = pos % 18;
if (cur) {
init_exist[row][col] = 1;
//printf("%d %d\n", row, col);
}
else cur += ' ';
mp[0][0] = cur;
visit_row[row][cur] = 1;
visit_col[col][cur] = 1;
visit_squard[row / 3][(col / 6)][cur] = 1;
pos += 2;
for (int i = 0;i < 80;i++) {
fscanf(input, "%d", &cur);
row = pos / 18;
col = pos % 18;
visit_row[row][cur] = 1;
visit_col[col][cur] = 1;
visit_squard[row / 3][(col / 6)][cur] = 1;
if (cur == 0) cur += ' ';
else {
init_exist[row][col] = 1;
//printf("%d %d\n", row, col);
}
mp[row][col] = cur;
pos += 2;
}
cnt = 0;
flag = 0;
pos = 0;
cnt_num = 0;
DWORD s, e;
s = GetTickCount();
solve(0);
e = GetTickCount();
total += e - s;
memset(visit_col, 0, sizeof(visit_col));
memset(visit_row, 0, sizeof(visit_row));
memset(visit_squard, 0, sizeof(visit_squard));
memset(init_exist, 0, sizeof(init_exist));
if (!flag_blank) {
flag_blank = 1;
}
else {
fputs("\n\n", res);
}
print_res();
memset(mp, 0, sizeof(mp));
for (int row = 0;row < 9;row++) {
for (int col = 0;col < 17;col++) {
mp[row][col] = ' ';
mp[row][17] = '\0';
}
}
/* if (cur) {
char row = pos / 18;
char col = pos % 18;
mp[row][col] = cur;
visit_row[row][cur] = 1;
visit_col[col][cur] = 1;
visit_squard[row / 3][(col / 6)][cur] = 1;
init_exist[row][col] = 1;
}
cnt_num++;
pos += 2;
if (cnt_num == 81) {
cnt = 0;
flag = 0;
pos = 0;
cnt_num = 0;
solve(0);
memset(visit_col, 0, sizeof(visit_col));
memset(visit_row, 0, sizeof(visit_row));
memset(visit_squard, 0, sizeof(visit_squard));
if (!flag_blank) {
flag_blank = 1;
}
else {
fputs("\n\n", res);
}
print_res();
memset(mp, 0, sizeof(mp));
for (int row = 0;row < 9;row++) {
for (int col = 0;col < 17;col++) {
mp[row][col] = ' ';
mp[row][17] = '\0';
}
}
}
}*/
}
fclose(input);
fclose(res);
printf("%ld\n", total);
}