Given a set of integers, find distinct sum that can be generated from the subsets of the given sets and print them in an increasing order. It is given that sum of array elements is small.
Examples:
Input : arr[] = {1, 2, 3}
Output : 0 1 2 3 4 5 6
Distinct subsets of given set are
{}, {1}, {2}, {3}, {1,2}, {2,3},
{1,3} and {1,2,3}. Sums of these
subsets are 0, 1, 2, 3, 3, 5, 4, 6
After removing duplicates, we get
0, 1, 2, 3, 4, 5, 6
Input : arr[] = {2, 3, 4, 5, 6}
Output : 0 2 3 4 5 6 7 8 9 10 11 12
13 14 15 16 17 18 20
Input : arr[] = {20, 30, 50}
Output : 0 20 30 50 70 80 100
The naive solution for this problem is to generate all the subsets, store their sums in a hash set and finally print all keys from hash set.
C++
// C++ program to print distinct subset sums of // a given array. #include<bits/stdc++.h> using namespace std; // sum denotes the current sum of the subset // currindex denotes the index we have reached in // the given array void distSumRec(int arr[], int n, int sum, int currindex, unordered_set<int> &s) { if (currindex > n) return; if (currindex == n) { s.insert(sum); return; } distSumRec(arr, n, sum + arr[currindex], currindex+1, s); distSumRec(arr, n, sum, currindex+1, s); } // This function mainly calls recursive function // distSumRec() to generate distinct sum subsets. // And finally prints the generated subsets. void printDistSum(int arr[], int n) { unordered_set<int> s; distSumRec(arr, n, 0, 0, s); // Print the result for (auto i=s.begin(); i!=s.end(); i++) cout << *i << " "; } // Driver code int main() { int arr[] = {2, 3, 4, 5, 6}; int n = sizeof(arr)/sizeof(arr[0]); printDistSum(arr, n); return 0; } |
chevron_right
filter_none
Java
// Java program to print distinct // subset sums of a given array. import java.io.*; import java.util.*; class GFG { // sum denotes the current sum // of the subset currindex denotes // the index we have reached in // the given array static void distSumRec(int arr[], int n, int sum, int currindex, HashSet<Integer> s) { if (currindex > n) return; if (currindex == n) { s.add(sum); return; } distSumRec(arr, n, sum + arr[currindex], currindex + 1, s); distSumRec(arr, n, sum, currindex + 1, s); } // This function mainly calls // recursive function distSumRec() // to generate distinct sum subsets. // And finally prints the generated subsets. static void printDistSum(int arr[], int n) { HashSet<Integer> s = new HashSet<>(); distSumRec(arr, n, 0, 0, s); // Print the result for (int i : s) System.out.print(i + " "); } //Driver code public static void main(String[] args) { int arr[] = { 2, 3, 4, 5, 6 }; int n = arr.length; printDistSum(arr, n); } } // This code is contributed by Gitanjali. |
chevron_right
filter_none
Output:
0 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 20
Time complexity of the above naive recursive approach is O(2n).
Time complexity of the above problem can be improved using Dynamic Programming, especially when sum of given elements is small. We can make a dp table with rows containing the size of the array and size of the column will be sum of all the elements in the array.
C++
// C++ program to print distinct subset sums of // a given array. #include<bits/stdc++.h> using namespace std; // Uses Dynamic Programming to find distinct // subset sums void printDistSum(int arr[], int n) { int sum = 0; for (int i=0; i<n; i++) sum += arr[i]; // dp[i][j] would be true if arr[0..i-1] has // a subset with sum equal to j. bool dp[n+1][sum+1]; memset(dp, 0, sizeof(dp)); // There is always a subset with 0 sum for (int i=0; i<=n; i++) dp[i][0] = true; // Fill dp[][] in bottom up manner for (int i=1; i<=n; i++) { dp[i][arr[i-1]] = true; for (int j=1; j<=sum; j++) { // Sums that were achievable // without current array element if (dp[i-1][j] == true) { dp[i][j] = true; dp[i][j + arr[i-1]] = true; } } } // Print last row elements for (int j=0; j<=sum; j++) if (dp[n][j]==true) cout << j << " "; } // Driver code int main() { int arr[] = {2, 3, 4, 5, 6}; int n = sizeof(arr)/sizeof(arr[0]); printDistSum(arr, n); return 0; } |
chevron_right
filter_none
Java
// Java program to print distinct // subset sums of a given array. import java.io.*; import java.util.*; class GFG { // Uses Dynamic Programming to // find distinct subset sums static void printDistSum(int arr[], int n) { int sum = 0; for (int i = 0; i < n; i++) sum += arr[i]; // dp[i][j] would be true if arr[0..i-1] // has a subset with sum equal to j. boolean[][] dp = new boolean[n + 1][sum + 1]; // There is always a subset with 0 sum for (int i = 0; i <= n; i++) dp[i][0] = true; // Fill dp[][] in bottom up manner for (int i = 1; i <= n; i++) { dp[i][arr[i - 1]] = true; for (int j = 1; j <= sum; j++) { // Sums that were achievable // without current array element if (dp[i - 1][j] == true) { dp[i][j] = true; dp[i][j + arr[i - 1]] = true; } } } // Print last row elements for (int j = 0; j <= sum; j++) if (dp[n][j] == true) System.out.print(j + " "); } // Driver code public static void main(String[] args) { int arr[] = { 2, 3, 4, 5, 6 }; int n = arr.length; printDistSum(arr, n); } } // This code is contributed by Gitanjali. |
chevron_right
filter_none
C#
// C# program to print distinct // subset sums of a given array. using System; class GFG { // Uses Dynamic Programming to // find distinct subset sums static void printDistSum(int []arr, int n) { int sum = 0; for (int i = 0; i < n; i++) sum += arr[i]; // dp[i][j] would be true if arr[0..i-1] // has a subset with sum equal to j. bool [,]dp = new bool[n + 1,sum + 1]; // There is always a subset with 0 sum for (int i = 0; i <= n; i++) dp[i,0] = true; // Fill dp[][] in bottom up manner for (int i = 1; i <= n; i++) { dp[i,arr[i - 1]] = true; for (int j = 1; j <= sum; j++) { // Sums that were achievable // without current array element if (dp[i - 1,j] == true) { dp[i,j] = true; dp[i,j + arr[i - 1]] = true; } } } // Print last row elements for (int j = 0; j <= sum; j++) if (dp[n,j] == true) Console.Write(j + " "); } // Driver code public static void Main() { int []arr = { 2, 3, 4, 5, 6 }; int n = arr.Length; printDistSum(arr, n); } } // This code is contributed by nitin mittal. |
chevron_right
filter_none
Output:
0 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 20
Time complexity of the above approach is O(n*sum) where n is the size of the array and sum is the sum of all the integers in the array.
This article is contributed by Karan Goyal. If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.
Recommended Posts:
- Find all distinct subset (or subsequence) sums of an array | Set-2
- Partition a set into two subsets such that the difference of subset sums is minimum
- Find if there is any subset of size K with 0 sum in an array of -1 and +1
- Count distinct occurrences as a subsequence
- Subset array sum by generating all the subsets
- Largest divisible subset in array
- Check whether bitwise AND of a number with any subset of an array is zero or not
- Find all distinct palindromic sub-strings of a given string
- Number of ways to form an array with distinct adjacent elements
- Given two strings, find if first string is a subsequence of second
- Find a sorted subsequence of size 3 in linear time
- Find the Increasing subsequence of length three with maximum product
- Find the Longest Increasing Subsequence in Circular manner
- Minimum number of elements which are not part of Increasing or decreasing subsequence in array
- Find number of times a string occurs as a subsequence in given string
Improved By : nitin mittal