Sum it up problem

#1

i am not able to form the code for this problem .
pls tell the correct code.

#2

I have provided you with pseudo code, please try to code it. if problem persists give me the code, i’ll point out the mistake.
Sort the array(non-decreasing).
First remove all the duplicates from array.
Then use recursion and backtracking to solve the problem.

  1. If at any time sub-problem sum == 0 then add that array to the result (vector of vectors).
  2. Else if sum if negative then ignore that sub-problem.
  3. Else insert the present array in that index to the current vector and call the function with sum = sum-ar[index] and index = index, then pop that element from current index (backtrack) and call the function with sum = sum and index = index+1
#3

getting some errors…can you provide the code