AcWing 1432. 棋盘挑战
原题链接
中等
作者:
Pluto_990
,
2021-01-24 07:43:53
,
所有人可见
,
阅读 258
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 100;
int n;
int arr[maxn + 5];
bool a[maxn + 5], b[maxn + 5], c[maxn + 5];
int cnt;
void backtrack(int k)
{
if(k > n) {
if ( cnt < 3 ){
for(int i = 1; i <= n; ++i) {
cout << arr[i] << " ";
}
cout << endl;
}
cnt++;
}
else {
for(int i = 1; i <= n; ++i) {
if(!a[i] && !b[i - k + n] && !c[i + k]) {
arr[k] = i;
a[i] = b[i - k + n] = c[i + k] = true;
backtrack(k + 1);
a[i] = b[i - k + n] = c[i + k] = false;
}
}
}
}
int main()
{
cin >> n;
backtrack(1);
cout << cnt << endl;
return 0;
}