a solution to the Subset Sum Problem

[Skaperen]

Occam's Typo. He meant to write -13.

twice? in the original set, and in the solution set right after it?

[league55]

My code has (-3) not 3. It also has (13). Is that not visible in your displays?

[Mekire]

Regardless of what you have, -3 and 13 doesn't give a sum of 0. On this point I agree with Skape.

[Skaperen]

@league55: what 2-set do you mean that has a sum of 0?

Output:
>>> sum({-3,13})==0
False
>>>

---

Output:
>>> s
{0, 2, 5, 7, 13, -3}
>>> [ (p,q) for p in s for q in s if p!=q and sum({p,q})==0 ]
[]
>>>

[league55]

Oh, I see my mistake. The sum is 10!

Thanks everyone for being patient. I'll edit the original post to add a note.

[Skaperen]

just do it in a modulo 10 world. problem solved.

[ledhead]

I am wondering, how would you modify the above program so that it only outputs solutions of fixed size k (if they exist)?