Add solution for UVA 562 Dividing Coins
Dynamic Programming
Converted as 0/1 knapsack problem with 2 knapsacks which capacity is (sum /
2), and try to maximize one of the knapsacks.