You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
75 lines
1.3 KiB
75 lines
1.3 KiB
#include<bits/stdc++.h>
|
|
using namespace std;
|
|
//递归方法解决
|
|
//可以理解为两次n皇后查找问题
|
|
//每找到一种黑皇后摆放方式,就在此基础上找出所有白皇后摆放方式
|
|
using namespace std;
|
|
int warray[9] = {0}; //用于存放白皇后位置 warray[1] = 2,表示1行2列有白皇后
|
|
int barray[9] = {0}; //用于存放黑皇后位置
|
|
int vis[9][9] = {0}; //用于存放输入矩阵
|
|
int n;
|
|
int cnt = 0; //记录摆放方法总数
|
|
int whiteQuene(int x){ //摆放白皇后
|
|
if(x > n){
|
|
cnt++;
|
|
return 0;
|
|
}
|
|
|
|
for(int tj = 1;tj <= n;tj++){
|
|
if(!vis[x][tj] || tj == barray[x]){
|
|
continue;
|
|
}
|
|
int j = 1;
|
|
while(j < x){ //检测是否相同列或者对角线已存在相同颜色皇后
|
|
if(warray[j] == tj || fabs(j - x) == fabs(warray[j] - tj)){
|
|
break;
|
|
}
|
|
j++;
|
|
}
|
|
if(j == x){
|
|
warray[x] = tj;
|
|
whiteQuene(x + 1);
|
|
}
|
|
}
|
|
return 0;
|
|
|
|
}
|
|
int blackQuene(int x){ // 摆放黑皇后
|
|
if(x > n){
|
|
whiteQuene(1); //每当黑皇后摆放完一种,就开始摆放白皇后
|
|
return 0;
|
|
}
|
|
for(int tj = 1;tj <= n;tj++){
|
|
if(!vis[x][tj]){
|
|
continue;
|
|
}
|
|
|
|
|
|
int j = 1;
|
|
while(j < x){ //检测是否相同列或者对角线已存在相同颜色皇后
|
|
if(barray[j] == tj || fabs(x - j) == fabs(tj - barray[j])){
|
|
break;
|
|
}
|
|
j++;
|
|
}
|
|
if(j == x){
|
|
barray[x] = tj;
|
|
blackQuene(x + 1);
|
|
}
|
|
}
|
|
}
|
|
int main()
|
|
{
|
|
cin>>n;
|
|
for(int i = 1;i <= n;i++){
|
|
for(int j = 1;j <= n;j++){
|
|
int t;
|
|
cin>>t;
|
|
vis[i][j] = t;
|
|
}
|
|
}
|
|
blackQuene(1);
|
|
cout<<cnt;
|
|
return 0;
|
|
}
|