棋盘问题 POJ - 1321

传送门

代码：

#include<iostream>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <string>
#include <cmath>
#include <stack>
#include <queue>
#include <vector>
#include <set>
#include <map>
#include <functional>
#include <ctime>
#include <iomanip>
#include <sstream>
#include <algorithm>
#define ll long long
#define PI acos(-1)
#define mes(x,y) memset(x,y,sizeof(x))
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)
using namespace std;
int n, k, to;
string a[10];
int mm[10];
void DFS(int step, int flag) {
	if (step == k) {
		to++;
		return;
	}
	if (flag >= n)return;
	for (int i = 0; i < n; i++) {
		if (mm[i] == 0 && a[flag][i] == '#') {
			mm[i] = 1;
			DFS(step + 1, flag + 1);
			mm[i] = 0;
		}
	}
	DFS(step, flag + 1);
}
int main() {
	while (cin>>n>>k) {
		if (n == -1 && k == -1)break;
		for (int i = 0; i < n; i++) {
			cin >> a[i];
		}
		to = 0;
		for (int i = 0; i <= n; i++)mm[i] = 0;
		DFS(0, 0);
		printf("%d\n", to);
	}
}