poj1321变种8皇后

#include<iostream>
#include<cstdio>
using namespace std;
char Arr[8][8] = { '\0' };
int num = 0, k = 0, n = 0, map[8] = { 0 };
void dfs(int row, int p)
{
	int a = 0, b = 0;
	if (p == k) {
		num++;
		return;
	}
	if (row == n) return;
	for (a = 0; a < n; a++)//列
	{
		if (Arr[row][a] == '#')
		{
			for (b = 0; b < row; b++)
			{
				if (map[b] == a)    break;
			}
			if (b == row)
			{
				map[row] = a;
				dfs(row + 1, p + 1);
				map[row] = -1;
			}
		}
	}
	dfs(row + 1, p);
}
int main()
{
	int i = 0, j = 0;
	for (i = 0; i < 8; i++) map[i] = -1;
	while (cin >> n&&cin >> k)
	{
		if (n == -1 && k == -1) return 0;
		getchar();
		for (i = 0; i < n; i++)
		{
			for (j = 0; j < n; j++)
				cin >> Arr[i][j];
			getchar();
		}
		dfs(0, 0);
		cout << num << endl;
		num = 0;
	}
	return 0;
}