写代码不写注释谁不想干你
题目我就不粘贴了
code
#include <iostream>
#include <cmath>
using namespace std;
int n, map[8][8], ans;
int bq[8], wq[8];
int WQ(int k)
{
if (k == n)
{
ans++;
}
int i, j;
for (i = 0; i < n; i++)
{
if (map[k][i] == 0) continue;
if (bq[k] == i) continue;
for (j = 0; j < k; j++)
{
if(wq[j]==i || abs(wq[j]-i) == k-j) break;
}
if (j == k)
{
wq[k] = i;
WQ(k + 1);
}
}
}
int BQ(int k)
{
if (k == n)
{
WQ(0);
}
int i ,j;
for(i=0;i<n;i++)
{
if(map[k][i] == 0) continue;
for(j=0;j<k;j++)
{
if(bq[j]==i || abs(bq[j]-i) == k-j) break;
}
if(j == k)
{
bq[k] = i;
BQ(k+1);
}
}
}
int main()
{
ans = 0;
cin>>n;
for(int i=0;i<n;i++)
{
for(int j=0;j<n;j++)
{
cin>>map[i][j];
}
}
BQ(0);
cout<<ans<<endl;
return 0;
}