75 lines
1.4 KiB
C++
75 lines
1.4 KiB
C++
|
#include<bits/stdc++.h>
|
|||
|
|
using namespace std;
|
|||
|
|
//<2F>ݹ鷽<DDB9><E9B7BD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
|
|||
|
|
//<2F><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>Ϊ<EFBFBD><CEAA><EFBFBD><EFBFBD>n<EFBFBD>ʺ<EFBFBD><CABA><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
|
|||
|
|
//ÿ<>ҵ<EFBFBD>һ<EFBFBD>ֺڻʺ<DABB><CABA>ڷŷ<DAB7>ʽ<EFBFBD><CABD><EFBFBD><EFBFBD><EFBFBD>ڴ˻<DAB4><CBBB><EFBFBD><EFBFBD><EFBFBD><EFBFBD>ҳ<EFBFBD><D2B3><EFBFBD><EFBFBD>аʺ<D7BB><CABA>ڷŷ<DAB7>ʽ
|
|||
|
|
using namespace std;
|
|||
|
|
int warray[9] = {0}; //<2F><><EFBFBD>ڴ<EFBFBD><DAB4>Űʺ<D7BB>λ<EFBFBD><CEBB> warray[1] = 2,<2C><>ʾ1<CABE><31>2<EFBFBD><32><EFBFBD>аʺ<D7BB>
|
|||
|
|
int barray[9] = {0}; //<2F><><EFBFBD>ڴ<EFBFBD><DAB4>źڻʺ<DABB>λ<EFBFBD><CEBB>
|
|||
|
|
int vis[9][9] = {0}; //<2F><><EFBFBD>ڴ<EFBFBD><DAB4><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
|
|||
|
|
int n;
|
|||
|
|
int cnt = 0; //<2F><>¼<EFBFBD>ڷŷ<DAB7><C5B7><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
|
|||
|
|
int whiteQuene(int x){ //<2F>ڷŰʺ<D7BB>
|
|||
|
|
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){ //<2F><><EFBFBD><EFBFBD><EFBFBD>Ƿ<EFBFBD><C7B7><EFBFBD>ͬ<EFBFBD>л<EFBFBD><D0BB>߶Խ<DFB6><D4BD><EFBFBD><EFBFBD>Ѵ<EFBFBD><D1B4><EFBFBD><EFBFBD><EFBFBD>ͬ<EFBFBD><CDAC>ɫ<EFBFBD>ʺ<EFBFBD>
|
|||
|
|
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){ // <20>ڷźڻʺ<DABB>
|
|||
|
|
if(x > n){
|
|||
|
|
whiteQuene(1); //ÿ<><C3BF><EFBFBD>ڻʺ<DABB><CABA>ڷ<EFBFBD><DAB7><EFBFBD>һ<EFBFBD>֣<EFBFBD><D6A3>Ϳ<EFBFBD>ʼ<EFBFBD>ڷŰʺ<D7BB>
|
|||
|
|
return 0;
|
|||
|
|
}
|
|||
|
|
for(int tj = 1;tj <= n;tj++){
|
|||
|
|
if(!vis[x][tj]){
|
|||
|
|
continue;
|
|||
|
|
}
|
|||
|
|
|
|||
|
|
|
|||
|
|
int j = 1;
|
|||
|
|
while(j < x){ //<2F><><EFBFBD><EFBFBD><EFBFBD>Ƿ<EFBFBD><C7B7><EFBFBD>ͬ<EFBFBD>л<EFBFBD><D0BB>߶Խ<DFB6><D4BD><EFBFBD><EFBFBD>Ѵ<EFBFBD><D1B4><EFBFBD><EFBFBD><EFBFBD>ͬ<EFBFBD><CDAC>ɫ<EFBFBD>ʺ<EFBFBD>
|
|||
|
|
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;
|
|||
|
|
}
|