接下来n行,每行n个0或1的整数,如果一个整数为1,表示对应的位置可以放皇后,如果一个整数为0,表示对应的位置不可以放皇后。
1 1 1 1
1 1 1 1
1 1 1 1
1 1 1 1
1 0 1 1
1 1 1 1
1 1 1 1
1 1 1 1
#include <stdio.h>
char chessboard[9][9] ;//棋盘
int blackqueen[9];//黑皇后放置
int whitequeen[9];//白皇后放置
int count = 0;//不同的放置情况的总数
int check(int queen[], int n){
int i;
for (i = 1; i < n; i++) {
int judge = queen[i] - queen[n];
if (judge == 0 || judge == i - n || judge == n - i ) {
return 0;
}
}
return 1;
}
void wqueen(int line, int n){
int i;
if (line == n+1) {
count++;
}else{
for ( i = 1; i <= n; i++) {
if (chessboard[line][i] == '1' && i != blackqueen[line]) {
whitequeen[line] = i;
if (check(whitequeen, line)) {
wqueen(line+1, n);
}
}
}
}
}
void bqueen(int line, int n){
int i;
if (line == n+1) {
wqueen(1, n);
}else{
for (i = 1; i <= n; i++) {
if (chessboard[line][i] == '1') {
blackqueen[line] = i;
if (check(blackqueen, line)) {
bqueen(line+1, n);
}
}
}
}
}
int main(int argc, char ** argv){
int n = 5 , i, j;
scanf("%d", &n);
getchar();
for (i = 1; i <= n; i++) {
for (j = 1; j <= n; j++) {
scanf("%c", &chessboard[i][j]);
if (j != n) {
getchar();
}
}
getchar();
}
bqueen(1, n);
printf("%d",count);
return 0;
}