poj 1321 棋盘问题
import java.util.Arrays;
import java.util.Scanner;
public class POJ1321棋盘问题 {
static int n;
static int k;
static int ans;
static boolean[] rows;
static boolean[] cols;
static char[][] chess;
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
while (true) {
n = in.nextInt();
k = in.nextInt();
if (n == -1 && k == -1) {
break;
}
ans = 0;
chess = new char[n][n];
rows = new boolean[n];
cols = new boolean[n];
Arrays.fill(rows, false);
Arrays.fill(cols, false);
for (int i = 0; i < n; i++) {
String str = in.next();
chess[i] = str.toCharArray();
}
dfs(0, 0);
System.out.println(ans);
}
}
static void dfs (int count, int s) {
if (count == k) {
ans++;
return;
}
for (int i = s; i < n; i++) {
for (int j = 0; j < n; j++) {
if (rows[i] == false && cols[j] == false && chess[i][j] == '#') {
rows[i] = true;
cols[j] = true;
dfs(count + 1, i + 1);
rows[i] = false;
cols[j] = false;
}
}
}
}
}