Finding the maximum sum that can be formed from a set, by partitioning it into two subset

Правка en1, от bikram28, 2018-10-02 16:15:52

Given a set of numbers S. Find maximum sum such that Sum(A1) = Sum(A2) Where, A1⊂S and A2⊂S and A1⋂A2=∅ And Sum(X), is the sum of all elements within the set X

in cpp :)

thanks in advance !

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en4 Английский bikram28 2018-10-02 21:20:07 136
en3 Английский bikram28 2018-10-02 16:23:38 13 Tiny change: ' case#\n25\n5 27 24 ' -> ' case#\n25 elements -->\n5 27 24 '
en2 Английский bikram28 2018-10-02 16:18:11 96
en1 Английский bikram28 2018-10-02 16:15:52 293 Initial revision (published)