Question: subset sum problem

Darts.mw

I think it was Acer who did the coding for a similar previous problem. I modified it to find the components of a set which sum to 150.

Why is it that it doesn't find all the solutions with {assume=nonnegint}. eg i have to run a additional pgm {assume=binary} to catch all solutions.

1. is there a procedure to catch all?

2. is there a way i can put the list and the desired sum in the input: eg SSP([10,20,30,40,50],150)

Please Wait...