POJ 1321 棋盤問題

/* 
 *	POJ 1321
 *	URL: http://poj.org/problem?id=1321
 *	Author: Ceeji Cheng
 *	Type: Depth First Search
 *	Status: Programing
 *	Visit http://ceeji.net/ for more information.
 *	2011-02-24 15:34
 */
 
#include <iostream>
#include <cstring>
#include <string>
 
using namespace std;
 
#define MAX_N 8
 
int matrix[MAX_N][MAX_N];
bool has[MAX_N];
int n, k, res = 0;
string ts;
 
void search(int p, int line)
{
	if (line >= n)
	{
		if (p == k)
			++res;
		return;
	}
	for (int i = 0; i < n; ++i)
	{
		if (matrix[line][i] && !has[i])
		{
			has[i] = true;
			search(p + 1, line + 1);
			has[i] = false;
		}
	}
	search(p, line + 1);
}
 
int main (int argc, char const* argv[])
{
	while (cin >> n >> k && n != -1)
	{
		// clear the matrix.
		memset(matrix, 0, sizeof(matrix));
		// init.
		for (int i = 0; i < n; ++i)
		{
			cin >> ts;
			for (int j = 0; j < n; ++j)
				matrix[i][j] = ts[j] == '#' ? 1 : 0;
		}
		res = 0;
		search(0, 0);
		cout << res << endl;
	}
	return 0;
}