Dinesman's multiple-dwelling problem: Difference between revisions
Content added Content deleted
(→{{header|D}}: added D) |
m (→{{header|D}}) |
||
Line 137: | Line 137: | ||
auto c3 = (int[] s){ return s[Fletcher] != 0 && s[Fletcher] != s.length-1; }; |
auto c3 = (int[] s){ return s[Fletcher] != 0 && s[Fletcher] != s.length-1; }; |
||
auto c4 = (int[] s){ return s[Miller] > s[Cooper]; }; |
auto c4 = (int[] s){ return s[Miller] > s[Cooper]; }; |
||
auto c5 = (int[] s){ return abs(s[ |
auto c5 = (int[] s){ return abs(s[Smith] - s[Fletcher]) != 1; }; |
||
auto c6 = (int[] s){ return abs(s[ |
auto c6 = (int[] s){ return abs(s[Cooper] - s[Fletcher]) != 1; }; |
||
if (auto sol = solve(Floors, c1, c2, c3, c4, c5, c6)) |
if (auto sol = solve(Floors, c1, c2, c3, c4, c5, c6)) |