【简单搜索】POJ1321棋盘问题

#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
using namespace std;
char map[10][10];
int vis[10];
int m, n;
int ans = 0;
void dfs(int x, int num)
{
    if (num == 0)
    {
        ans++;
        return;
    }
    if (x >= m) return;
    for (int i = 0;i < m;i++)
    {
        if (map[x][i] == '#'&&(vis[i]==0))
        {
            vis[i] = 1;
            dfs(x + 1, num - 1);
            vis[i] = 0;
        }
    }
    if (x + num <= m) //剪枝，x+num>m的情况明显不满足题意，不需要再继续dfs了
        dfs(x + 1, num);
}
int main()
{
    while (cin >> m >> n, (m != -1 && n != -1))
    {
        memset(vis, 0, sizeof(vis));
        memset(map, 0, sizeof(map));
        for (int i = 0;i < m;i++)
            for (int j = 0;j < m;j++)
                cin >> map[i][j];
        ans = 0;
        dfs(0, n);
        cout << ans << endl;
    }
}