-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathSubsets.cpp
More file actions
99 lines (94 loc) · 1.72 KB
/
Subsets.cpp
File metadata and controls
99 lines (94 loc) · 1.72 KB
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
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
#include<iostream>
#include<stdlib.h>
#include <vector>
using namespace std;
int number=0;
vector< vector< int > > subset(vector< int > a, int n);
vector< vector< int > > union_subset(vector< vector< int > >, vector< vector< int > >);
vector< vector< int > > append(vector< vector< int > >, int n);
int main()
{
vector< int > a;
cout<<"Enter the number of numbers you are going to enter:\n";
cin>>number;
int i=0;
cout<<"Enter "<<number<<" numbers :\n";
int value;
for(i=0;i<number;i++)
{
cin>>value;
a.push_back(value);
}
vector< vector< int > > subsets;
subsets=subset(a,number);
int x = subsets.size();
int y=0,j=0,k=0;
for(i=0;i<x;i++)
{
if(subsets[i][0]==-2000000)
{
subsets[i][0]=subsets[i].back();
subsets[i].pop_back();
}
}
cout<<"THE SUBSETS ARE:\n\n";
for(k=0;k<=number;k++)
{
for(i=0;i<x;i++)
{
y=subsets[i].size();
if(k==y)
{
if(y==0)
{
cout<<"NULL"<<endl;
continue;
}
cout<<"{";
for(j=0;j<y-1;j++)
{
cout<<subsets[i][j]<<", ";
}
cout<<subsets[i][y-1]<<"}";
cout<<endl;
}
}
}
return 0;
}
vector< vector< int > > subset(vector< int > a, int n)
{
vector< vector< int > > temp;
if(n!=1)
{
int i=0;
temp=subset(a,n-1);
vector< vector< int > > temp2=temp;
for(i=0;i< temp2.size();i++)
{
temp2[i].push_back(a[n-1]);
}
temp=union_subset(temp,temp2);
}
else
{
vector< int > x;
x.push_back(-2000000);
temp.push_back(x);
x=vector< int > ();
x.push_back(a[0]);
temp.push_back(x);
}
return temp;
}
vector< vector< int > > union_subset(vector< vector< int > > a, vector< vector< int > > b)
{
int a_size=a.size();
int b_size=b.size();
int i=0,j=0;
for(i=0;i<b_size;i++)
{
a.push_back(b[i]);
}
return a;
}