Algorithms/SubsetSum.cpp at master · SiddharthaSen99/Algorithms · GitHub

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
64
65
66
67
68
69
70
71
72
73
74
#include<iostream>
#include<vector>
using namespace std;
vector<int> a;
int nsol=0,d;

void with(vector<int> sub,int sr,int sc,int i);
void without(vector<int> sub,int sr,int sc,int i);
int sum(vector<int> sub);
int main()
{
    int n,i,val;
    vector<int> sub;
    cout<<"Enter the number of elements in the set:";
    cin>>n;
    cout<<"\nEnter the elements:";
    for(i=0;i<n;i++)
    {
        cin>>val;
        a.push_back(val);
    }
    cout<<"\nEnter the maximum sum of the subsets:";
    cin>>d;
    with(sub,sum(a),0,0);
    without(sub,sum(a),0,0);
    cout<<"\nTotal number of possible subsets: "<<nsol;
    return 0;
}

void with(vector<int> sub,int sr,int sc,int i)
{
    if(sr+sc<d || i>=a.size())
        return;
    int j;
    sr=sr-a[i];
    sc=sc+a[i];
    sub.push_back(a[i]);
    if(sum(sub)==d)
    {
        cout<<"\nSubset "<<++nsol<<":\n";
        for(j=0;j<sub.size();j++)
            cout<<sub[j]<<" ";
        return;
    }
    with(sub,sr,sc,i+1);
    without(sub,sr,sc,i+1);

}
void without(vector<int> sub,int sr,int sc,int i)
{
    if(sr+sc<d || i>=a.size())
        return;
    if(sc>d)
        return;
    int j;
    sr=sr-a[i];
    sc=sc+a[i];
    if(sum(sub)==d)
    {
        cout<<"\nSubset "<<++nsol<<":\n";
        for(j=0;j<sub.size();j++)
            cout<<sub[j]<<" ";
        return;
    }
    with(sub,sr,sc,i+1);
    without(sub,sr,sc,i+1);
}
int sum(vector<int> sub)
{
    int sum=0,i;
    for(i=0;i<sub.size();i++)
        sum+=sub[i];
    return sum;
}