题目链接:点击打开链接
分析:就是八皇后问题,只是要注意只有k个棋子,也要注意下递归边界的处理
附上代码:
#include<iostream>
#include<algorithm>
#include<cstring>
using namespace std;
#define judge(x,y) !vis[y]&&a[x][y]=='#'
char a[10][10];
bool vis[10];
int n, k, ans;
void dfs(int kase, int cur) //kase代表以摆棋数,cur+1代表当前行
{
if (kase == k && cur == n)
{
ans++;
return;
}
if (cur >= n) return;
for (int i = 0; i <= n; i++)
{
if (judge(cur + 1, i) || !i)
{
vis[i] = 1;
dfs(!i ? kase : kase + 1, cur + 1);
vis[i] = 0;
}
}
return;
}
int main()
{
while (cin >> n >> k&&~n)
{
memset(vis, false, sizeof vis);
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++)
cin >> a[i][j];
ans = 0;
dfs(0, 0);
printf("%d\n", ans);
}
return 0;
}