https://ide.codingblocks.com/s/55803
how to remove duplicates using backtracking
You are given an array of numbers and a target number(T) , print all unique combinations in the array whose sum equals the target number T. Note that each number in the array may only be used once in the combination.
Note:
All numbers (including target) will be positive integers
Elements in the combination must be in non-descending order
There should be no duplicate combinations
Input Format:
The first line will contain N indicating the number of elements in the array.
The second line will contain space separated N integers , A[i].
The third line will contain the target number T.
Constraints:
N <= 15
1<= A[I] <= 100
Output Format:
Print all unique combinations of the numbers satisfying the above constraints in a separate line in lexicographic manner.
Sample Input:
7
10 1 2 7 6 1 5
8
Sample Output:
1 1 6
1 2 5
1 7
2 6
