-
Notifications
You must be signed in to change notification settings - Fork 0
/
subset_sum_to_k.cpp
63 lines (45 loc) · 1.18 KB
/
subset_sum_to_k.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
Print Subset Sum to K
Given an array A and an integer K, print all subsets of A which sum to K.
Subsets are of length varying from 0 to n, that contain elements of the array. But the order of elements should remain same as in the input array.
Note : The order of subsets are not important. Just print them in different lines.
#include<cmath>
using namespace std;
void printSubsetSumToK(int input[], int n, int k) {
int b[n],i;
for(i=0;i<=pow(2,n)-1;i++)
{
int j;
for(j=0;j<n;j++)
{
b[j]=0;
}
int kk,temp,sum;
kk=n-1;
temp=i;
sum=0;
while(temp!=0)
{
b[kk--]=temp%2;
temp=temp/2;
}
for(j=0;j<n;j++)
{
if(b[j]==1)
{
sum=sum+input[j];
}
}
//cout<<sum<<endl;
if(sum==k)
{
for(j=0;j<n;j++)
{
if(b[j]==1)
{
cout<<input[j]<<" ";
}
}
cout<<endl;
}
}
}