Subset sum problem: Difference between revisions
Content added Content deleted
(Updated first D entry) |
(Updated first D entry) |
||
| Line 371: | Line 371: | ||
foreach (immutable n; 1 .. items.length) |
foreach (immutable n; 1 .. items.length) |
||
foreach (const comb; combinations(items, n)) |
foreach (const comb; combinations(items, n)) |
||
if (comb.map!q{ a[1] }.sum == 0) |
|||
if (reduce!q{ a + b[1] }(0, comb) == 0) |
|||
return writefln("A subset of length %d: %-(%s, %)", n, |
return writefln("A subset of length %d: %-(%s, %)", n, |
||
comb.map!q{ a[0] }); |
comb.map!q{ a[0] }); |
||