
This is a C++/Presto program to solve the sum-of-subsets problem
using a parallel version of the backtracking algorithm described
in Horowitz and Sahni.

-q<num>		Set preemption quantum (default no time slicing)

-v		Print all solutions in gory detail

-t<num>		Set number of threads (default 4)

-n<num>		Set number of processors to use (default 4)

-s<num>		Set desired sum value
