Divide set of numbers into twosub sets with equal totals 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?
This is the partition problem, a well-known NP-complete problem.

This means that no "elegant" solution is known assuming that we require as a necessary condition for "elegance" that it can be proven to require only a polynomial amount of work.

However, if the numbers themselves (or the target sum) are small, there is a good dynamic programming algorithm; see the above linked Wikipedia article.
This is an NP problem, which means that it can only be solved in non-polynomial time, in this case if the set is called $S$, then the NP approach will cost:
$$(|S|-1)!$$
steps (at least that's the fastest I method know of).
If you find a way to do it in polynomial time, you'll have proven that P=NP and you'll win a millennium prize (also if you prove that such an approach does not exist).