problem code: ANUMLA

guys it says n elements , n is <= 15

so for n numbers total no of subsets can be maximum if n = 15 i.e 32768

so take all the subset sums input in a array and sort it

print the array from index 1 to n (both including)

it says wrong answer

can anyone explain why wrong answer

sorry guys found my mistake.