题目:
http://39.106.164.46/problem.php?id=1133
代码如下:
#include<iostream>
#include<stdio.h>
#include<cmath>
#include<algorithm>
#include<queue>
#include<set>
#include<vector>
#define MAX
#define INF 0x3f3f3f3f
typedef long long ll;
using namespace std;
int n,k,col[MAX];
int ans,cnt;
char ch[MAX][MAX];
void dfs(int cur){//当前行
if(cnt==k){
ans++;
return;
}
if(cur>=n) return;
for(int i=0;i<n;i++){
if(col[i]==0&&ch[cur][i]=='#'){
col[i]=1;
cnt++;
dfs(cur+1);
col[i]=0;
cnt--;
}
}
dfs(cur+1);
}
int main(){
while(scanf("%d %d",&n,&k)!=EOF){
memset(col,0,sizeof(col));
ans=cnt=0;
for(int i=0;i<n;i++){
scanf("%s",ch[i]);
}
dfs(0);
printf("%d\n",ans);
}
return 0;
}