Subset sum problem: Difference between revisions
Content added Content deleted
(Updated D entry) |
|||
| Line 276: | Line 276: | ||
if (reduce!q{ a + b[1] }(0, comb) == 0) { |
if (reduce!q{ a + b[1] }(0, comb) == 0) { |
||
writefln("A subset of length %d: %s", n, |
writefln("A subset of length %d: %s", n, |
||
//comb.map!q{ a[0] }.join(", ")); |
//comb.map!q{ a[0] }().join(", ")); |
||
comb.map!q{ cast()a[0] }.join(", ")); |
comb.map!q{ cast()a[0] }().join(", ")); |
||
return; |
return; |
||
} |
} |
||
writefln("No solution found."); |
writefln("No solution found."); |
||
}</lang> |
}</lang> |
||
{{out}} |
|||
Output: |
|||
<pre>A subset of length 2: archbishop, gestapo</pre> |
<pre>A subset of length 2: archbishop, gestapo</pre> |
||