AcWing 1432. 棋盘挑战
原题链接
中等
作者:
wjie
,
2021-01-22 12:46:28
,
所有人可见
,
阅读 376
#include <iostream>
#include <cstdio>
using namespace std;
int n, cnt, col[15], dg[30], udg[30], res[15];
void dfs(int cur)
{
if (cur > n)
{
if (cnt < 3)
{
for (int i = 1; i <= n; ++i) printf("%d ", res[i]);
puts("");
}
++cnt;
return;
}
for (int i = 1; i <= n; ++i)
{
if (!col[i] && !dg[i-cur+n] && !udg[cur+i])
{
col[i] = dg[i-cur+n] = udg[cur+i] = 1;
res[cur] = i;
dfs(cur+1);
col[i] = dg[i-cur+n] = udg[cur+i] = 0;
}
}
}
int main()
{
scanf("%d", &n);
dfs(1);
printf("%d", cnt);
return 0;
}