Hello all,

I'm unable to solve the below mentioned problem. Please see forward to this and help me out to solve that.

Problem Statement: We are given (2^n)-1 elements indicating all the possible sums of every possible subset of a set. Now we need to find the unknown set.

Constraints: n<=15,t<=10

Sample: 1 2 1 3 4 6 3 5 Output: 3 1 2 3

Thanks in advance.