-
Notifications
You must be signed in to change notification settings - Fork 17
/
QueenCombinations.java
84 lines (67 loc) · 2.22 KB
/
QueenCombinations.java
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
// M-I
import java.io.*;
import java.util.*;
public class Main {
// qpsf - queen placed so far
public static void queensCombinations(int qpsf, int tq, int row, int col, String asf){
if(row == tq) {
if(qpsf == tq) {
System.out.println(asf);
}
return;
}
int nr = 0, nc = 0;
String nasf, yasf;
if(col == tq-1) {
nr = row+1;
nc = 0;
nasf = asf + "-" + "\n";
yasf = asf + "q" + "\n";
} else {
nr = row;
nc = col+1;
nasf = asf + "-";
yasf = asf + "q";
}
queensCombinations(qpsf+1, tq, nr, nc, yasf);
queensCombinations(qpsf, tq, nr, nc, nasf);
}
public static void main(String[] args) throws Exception {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
int n = Integer.parseInt(br.readLine());
queensCombinations(0, n, 0, 0, "");
}
}
// M-II
import java.io.*;
import java.util.*;
public class Main {
public static void queensCombinations(int qpsf, int tq, boolean[][] chess, int i, int j){
int n = chess.length;
if(qpsf == tq) {
StringBuilder sb = new StringBuilder();
for(int x=0; x<n; x++) {
for(int y=0; y<n; y++) {
if(chess[x][y] == false) sb.append("-" + "\t");
else sb.append("q" + "\t");
}
sb.append("\n");
}
System.out.println(sb.toString());
return;
}
for(int x=i; x<n; x++) {
for(int y=(x == i? j + 1: 0); y<n; y++) {
chess[x][y] = true;
queensCombinations(qpsf+1, tq, chess, x,y);
chess[x][y] = false;
}
}
}
public static void main(String[] args) throws Exception {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
int n = Integer.parseInt(br.readLine());
boolean[][] chess = new boolean[n][n];
queensCombinations(0, n, chess, 0, -1);
}
}