Dinesman's multiple-dwelling problem: Difference between revisions

Content added Content deleted

Inline

@@ Line 117: / Line 117: @@
 }
-size_t[] solve(T...)(size_t len, T dgs) {
+size_t[] solve(T...)(size_t len, T fun) {
     auto perms = permutations(len);
     outer:
     foreach (p; perms) {
-        foreach (dg; dgs)
+        foreach (fn; fun)
-            if (!dg(cast(int[])p))
+            if (!fn(cast(int[])p))
                 continue outer;
         return p;