-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path2239.cpp
75 lines (66 loc) · 1.66 KB
/
2239.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
#include<iostream>
#include<string>
#include<cstring>
#include<bitset>
using namespace std;
int board[10][10];
bool answer;
int r[9];
int c[9];
int s[3][3];
int FULL = (1<<9)-1;
void recur(int row , int column){
//cout << row << ' ' << column << ' ' << bitset<9>(r[row]) << ' ' << bitset<9>(c[column]) << ' ' <<
//bitset<9>(s[row/3][column/3]) << '\n';
if(row == 9){
answer = 1;
for(int i = 0; i < 9; i++){
for(int j = 0 ; j < 9; j++){
cout << board[i][j];
}
cout << '\n';
}
return;
}
if(board[row][column] != 0){
if(column == 8)recur(row+1, 0);
else recur(row, column+1);
return;
}
for(int i = 1; i < 10; i++){
if((r[row] & (1<<(i-1))) == (1<<(i-1)))continue;
if((c[column] & (1<<(i-1))) == (1<<(i-1)))continue;
if((s[row/3][column/3] & (1<<(i-1))) == (1<<(i-1)))continue;
board[row][column] = i;
r[row] = (r[row] | (1<<(i-1)));
c[column] = (c[column] | (1<<(i-1)));
s[row/3][column/3] = (s[row/3][column/3] | (1<<(i-1)));
if(column == 8)recur(row+1, 0);
else recur(row, column+1);
if(answer)return;
board[row][column] = 0;
r[row] = (r[row] ^ (1<<(i-1)));
c[column] = (c[column] ^ (1<<(i-1)));
s[row/3][column/3] = (s[row/3][column/3] ^ (1<<(i-1)));
}
}
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
memset(r, (1<<9), sizeof(r));
memset(c, (1<<9), sizeof(c));
memset(s, (1<<9), sizeof(s));
for(int i = 0; i < 9; i++){
string tmp;
cin >> tmp;
for(int j = 0; j < 9; j++){
board[i][j] = tmp[j]-'0';
if(board[i][j] == 0)continue;
r[i] = (r[i]|(1<<(board[i][j]-1)));
c[j] = (c[j]|(1<<(board[i][j]-1)));
s[i/3][j/3] = (s[i/3][j/3]|(1<<(board[i][j]-1)));
}
}
recur(0, 0);
}