#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <iostream>
#include <algorithm>
#include <stack>
#include <queue>
#include <set>
#include <map>
#define ll long long
#define MAXN 10000007;
using namespace std;
char a[10][10];
int dpr[10],dpl[10];
int n, m, sum;
void dfs(int num, int s)
{
if(s > m){sum++;return ;}
if(dpr[num] == 1)return ;
int i, j;
for(j = num; j<= n; j++)
{
for(i = 1; i <= n; i++)
{
if(a[j][i] == '#' && dpr[j] == 0 && dpl[i] == 0)
{
dpr[j] = 1;
dpl[i] = 1;
dfs(j + 1, s+1);
dpr[j] = 0;
dpl[i] = 0;
}
}
}
return ;
}
int main()
{
std::ios::sync_with_stdio(0);
int i, j, k;
while(cin >> n >> m)
{
if(n == -1 && m == -1)break;
memset(dpr, 0, sizeof(dpr));
memset(dpl, 0, sizeof(dpl));
sum = 0;
for(i = 1; i <= n; i++)
{
for(j = 1; j <= n; j++)
{
cin >> a[i][j];
}
}
dfs(1, 1);
cout << sum << endl;
}
return 0;
}
POJ - 1321 棋盘问题 (深度优先搜索)
猜你喜欢
转载自blog.csdn.net/Miracle_QSH/article/details/82192246
今日推荐
周排行