挺简单的一道题,但是今天不怎么在状态,硬是写了一会才A的,就是一层一层的搜索,由于只需要放k(k <= n)个棋子,所以可以存在跳行的情况,即当前行不放任何棋子,直接进入下一行的
//leehaoze
#include <iostream>
#include <deque>
#include <string>
#include <vector>
#include <queue>
#include <cstdio>
#include <stack>
#include <algorithm>
#include <cstring>
#include <cctype>
#include <cstdio>
#include <cmath>
#include <cstdlib>
using namespace std;
const int INF = 1<<29;
#define INC_SAT( val ) (val = ((val)+1 > (val)) ? (val)+1 : (val))
#define ARR_SIZE( a ) ( sizeof( (a) ) / sizeof( (a[0]) ) )
#define ULL unsigned long long
#define MAXN 8
int n,k,ans;
char map[MAXN][MAXN];
bool line[MAXN];
bool Input(){
cin >> n >> k;
if(n == -1 && k == -1)
return false;
ans = 0;
memset(line,false,sizeof line);
for (int i = 0; i < n; ++i) {
for (int j = 0; j < n; ++j) {
cin >> map[i][j];
}
}
return true;
}
bool Legal(int row,int column){
return map[row][column] == '#' && !line[column];
}
void DFS(int row,int step){
if(step == k){
ans++;
return ;
}
if(row == n){
return ;
}
for (int j = 0; j < n; ++j) {
if(Legal(row,j)){
line[j] = true;
DFS(row + 1,step + 1);
line[j] = false;
}
}
DFS(row + 1,step);
}
int main() {
#ifdef LOCAL
freopen("IN.txt", "r", stdin);
#endif
std::ios::sync_with_stdio(false);
while(Input()){
DFS(0,0);
cout << ans << endl;
}
}