POJ 1321 *** 棋盘问题

题意:在一个给定形状的棋盘上放置棋子，任意两个棋子不能在同一行、同一列。题中给的数据中‘.’是不能放棋子的，‘#’才能放棋子。求所有可能的摆放方式。

想法:其实还是很简单的dfs。

代码如下:

#pragma warning(disable:4996)
#include<iostream>
#include<cstdio>
#include<cmath>
#include<stack>
#include<queue>
#include<cstring>
#include<sstream>
#include<set>
#include<string>
#include<iterator>
#include<vector>
#include<map>
#include<algorithm>
using namespace std;
struct Position {
	int x, y;
};
int n, k;
char maze[10][10];
int mark[2][10];
int cnt;

void dfs(int p, int q, int step) {
	if (step == k) { cnt++; return; }
	for (int i = p+1; i <= n; ++i)
		for (int j = 1; j <= n; ++j) 
			if (!mark[0][i] && !mark[1][j]&&maze[i][j]=='#') {
				mark[0][i] = mark[1][j] = 1;
				dfs(i, j, step + 1);
				mark[0][i] = mark[1][j] = 0;
			}
}

int main(void) {

	while (cin >> n >> k, n != -1 || k != -1) {
		for (int i = 1; i <= n; ++i)
			for (int j = 1; j <= n; ++j)
				cin >> maze[i][j];
		cnt = 0;
		memset(mark, 0, sizeof(mark));
		dfs(0,0,0);
		cout << cnt << endl;
	}
	return 0;
}