Chapter 3, Problem 15C

Explanation of Solution

Program code:

//include the required header files

#include<iostream>

#include<vector>

#include<cmath>

#include<algorithm>

#include<climits>

#include<string>

#include<queue>

#include<stack>

#include<set>

//use the std namespace

using namespace std;

//create a set st

set<string> st;

//define the method dp()

void dp(int n, int const m, vector<string> &vec, string s)

{

//if the value of n is grater than or equal to m

if(n>=m)

{

//create the substring

s = s.substr(0,s.length()-1);

//if the condtion is true

if(st.find(s) == st.end())

{

//insert the value

st.insert(s);

}

//return

return;

}

//call the method dp

dp(n+1,m,vec,s);

dp(n+1,m,vec,s + vec[n] + " ");

}

//create vector vec

vector<string> vec;

//define the main() function

int main()

{

//create required variables

int t=0;

int n=0;

//call the method clear()

vec.clear();

st.clear();

//prompt enter the number of elements

cout<<"Enter no elements you want in your set :";

//scan for the value

cin >> n;

//create string variable item

string item="";

//prompt enter the elements

cout<<"Enter the set elements :";

//iterate a for loop

for(int i=0;i<n;i++)

{

//scan for the value

cin >> item;

//add item to the vector

vec.push_back(item);

}

//print the statements

cout<<"\nTotal subsets are:";

//call the method sort()

sort(vec...