/
NQUEEN1.cpp
117 lines (89 loc) · 1.79 KB
/
NQUEEN1.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
#include <stdio.h>
#define MAX_ROW 12
#define MAX_COL 12
int board[MAX_ROW][MAX_COL];
int solution = 0;
void printBoard(int board[][MAX_COL], int size)
{
int i, j;
for (i=0; i<size; i++)
{
for (j=0; j<size; j++)
printf("%d", board[i][j]);
printf("\n");
}
printf("END\n");
}
int checkUp(int row, int col)
{
int i, r;
r = row-1;
for(i=r; i>=0; i--)
{
if (board[i][col] == 1) return 0;
}
return 1;
}
int checkUL(int row, int col)
{
int r, c;
r = row-1; c = col-1;
while (1)
{
if (r < 0 || c < 0) break;
if (board[r][c] == 1) return 0;
r--; c--;
}
return 1;
}
int checkUR(int row, int col, int size)
{
int r, c;
r = row-1; c = col+1;
while (1)
{
if (r < 0 || c >= size) break;
if (board[r][c] == 1) return 0;
r--; c++;
}
return 1;
}
void foo(int size, int rowId, int depth)
{
int i, j;
// printBoard(board, size);
for (i = 0; i < size; i++)
{
if (board[rowId][i] == 0)
{
if (checkUp(rowId, i) && checkUL(rowId, i) && checkUR(rowId, i, size))
{
if (depth == size) {
solution++;
return;
}
board[rowId][i] = 1;
foo(size, rowId+1, depth+1);
board[rowId][i] = 0;
}
}
}
}
int main()
{
int T, N;
int i, j;
int board[MAX_ROW][MAX_COL];
scanf("%d", &T);
while(T--)
{
for (i=0; i<MAX_ROW; i++)
for (j=0; j<MAX_COL; j++)
if (board[i][j]) board[i][j] = 0;
scanf("%d", &N);
foo(N, 0, 1);
printf("%d\n", solution);
solution = 0;
}
return 0;
}