project euler problem 103

Special subset sums: optimum

I do not like this problem too much.  It seems that everyone is using brute force method. The problem cannot be easily generalized to n = 10 or larger numbers.