Given a finite sequence of natural numbers. Determine wether it is possible to divide the numbers into two sets such as totals of both sets are equal. Show one variant of such distribution. Is there any subset of initial set with total of 100.
Now I only see a bruteforce approach to this problem - check totals of all of S(n,2) (Stirling number of the second kind) combinations for equality and show one such combination. And also check all possible combinations of initial set for equality to 100. Is there more elegant solution?