Problem of the day
The order of subsets is not important.
The order of elements in a particular subset should be in increasing order of the index.
The first line of input contains an integer 'N', which denotes the size of the array.
The second line contains 'N' single-space separated integers representing the elements of the array.
The third line contains a single integer 'K', which denotes the integer to which the subsets should sum to.
For each test case, print single-space separated integers of a subset of 'ARR' having sum = 'K'.
The output of each test case will be printed in a separate line.
You do not need to print anything, it has already been taken care of. Just implement the given function.
1 <= 'N' <= 16
- (10 ^ 6) <= ARR[i] <= (10 ^ 6)
- 16 * (10 ^ 6) <= 'K' <= 16 * (10 ^ 6)
Where βARR[i]β denotes the value for βithβ element of the array βARRβ and 'K' is the given sum.
Time Limit: 1 sec.
3
2 4 6
6
2 4
6
For the array'ARR' = {2, 4, 6}, we can have subsets {}, {2}, {4}, {6}, {2, 4}, {2, 6}, {4, 6}, {2, 4, 6}. Out of these 8 subsets, {2, 4} and {6} sum to the given 'K' i.e. 6.
6
5 -1 8 2 7 0
7
-1 8
-1 8 0
5 2
5 2 0
7
7 0