RosettaCodeData/Task/N-queens-problem/D/n-queens-problem-1.d
2023-07-01 13:44:08 -04:00

9 lines
291 B
D

void main() {
import std.stdio, std.algorithm, std.range, permutations2;
enum n = 8;
n.iota.array.permutations.filter!(p =>
n.iota.map!(i => p[i] + i).array.sort().uniq.count == n &&
n.iota.map!(i => p[i] - i).array.sort().uniq.count == n)
.count.writeln;
}