Reference no: EM132194681

Write a C++ program called all_subsets.cpp which displays all subsets of a set. In the problem, your program should read n characters from a user and display all subsets of the characters.

In the program, you can assume that the number of input characters is less than or equal to 15.

Your program should ask a user to enter the number of input characters.

After that, it should read the characters.

For the problem, you can assume that the input characters are always distinct.

The following presents a sample run of the program:

Number of input characters: 2

Enter 2 characters: a c

===== All Subsets =====

empty

{c}

{a}

{a,c}

At the above sample run, the sequence of subsets is not important. Therefore, this result is also fine.

Number of input characters: 2

Enter 2 characters: a c

===== All Subsets =====

{a,c}

empty

{c} {a}

[Hint]: You can use the binary representation of the numbers from 0 to 2n - 1 for the input n. For example, if the number of input characters is 2, all binary numbers from 0 to 22 - 1 (= 3) will be 00, 01, 10, and 11. Try to find a correspondence between a subset and its binary representation.

This is another sample run:

Number of input characters: 3

Enter 2 characters: c d f

===== All Subsets =====

empty {f}

{d}

{d,f}

{c}

{c,f}

{c,d}

{c,d,f}