-
Notifications
You must be signed in to change notification settings - Fork 0
/
BAEKJOON 2239
66 lines (61 loc) · 1.39 KB
/
BAEKJOON 2239
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
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.ArrayList;
public class Main {
static char[][] map= new char[9][9];
static ArrayList<Node> list = new ArrayList<>();
public static void main(String[] args) throws Exception{
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
for (int i = 0; i < 9; i++) {
map[i] = br.readLine().toCharArray();
}
for (int i = 0; i < 9; i++) {
for (int j = 0; j < 9; j++) {
if(map[i][j] == '0')
list.add(new Node(i,j));
}
}
check(0);
}
private static void check(int a) {
if(a == list.size()) {
for (int i = 0; i < 9; i++) {
for (int j = 0; j < 9; j++) {
System.out.print(map[i][j]);
}
System.out.println();
}
System.exit(0);
}
Node n = list.get(a);
boolean[] visit = new boolean[10];
for (int i = 0; i < 9; i++) {
if(map[n.y][i] != '0')
visit[map[n.y][i]-'0'] = true;
if(map[i][n.x] != '0')
visit[map[i][n.x]-'0'] = true;
}
int y = (n.y / 3) * 3;
int x = (n.x / 3) * 3;
for (int i = y; i < y+3; i++) {
for (int j = x; j < x+3; j++) {
if(map[i][j] != '0')
visit[map[i][j]-'0'] = true;
}
}
for (int i = 1; i < 10; i++) {
if(!visit[i]) {
map[n.y][n.x] = (char) (i+48);
check(a+1);
map[n.y][n.x] = '0';
}
}
}
static class Node{
int y,x;
Node(int y, int x){
this.y = y;
this.x = x;
}
}
}