深搜（模板题）

/********
Author Smile
先弄清楚状态，然后就是写递归的深搜
按照状态写
其实这种递归可以自己模拟在执行 
https://vjudge.csgrandeur.cn/contest/477341#problem/A
*********/
#include <iostream>
#include <algorithm>

using namespace std;
const int N = 20;
int n, k;
char w[N][N];
int vis[N * N];
int ans = 0;
int countt = 0;


void dfs(int h)
{
	if (countt == k)
	{
		ans++;
		return ;
	}
	if (h > n)
		return ;
	for (int i = 1; i <= n; ++i)
	{
		if (!vis[i] && w[h][i] == '#')
		{
			vis[i] = 1;
			countt++;
			dfs(h + 1);
			vis[i] = 0;
			countt--;
		}
	}
	dfs(h + 1);
}

int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0), cout.tie(0);
	while (cin >> n >> k)
	{
		ans = 0;
		if (n == -1 && k == -1)
			break;
		for (int i = 1; i <= n; ++i)
		{
			for (int j = 1; j <= n; ++j)
			{
				cin >> w[i][j];
			}
		}
		dfs(1);
		cout << ans << endl;
	}
	return 0;
}