### PROBLEM LINK:

**Author:**Kamal Verma

**Tester:** Ashish Ahuja

**Editorialist:** Ashish Ahuja

### DIFFICULTY:

CAKEWALK

### PREREQUISITES:

### PROBLEM:

This is undoubtedly the simplest problem on this planet.

### QUICK EXPLANATION:

As the name suggests the problem asks one to find out the subsets within a given set through programming.

### EXPLANATION:

I know what are you thinking, how stupid of someone to make a problem like this. But,it happens.

The problem is focused for absolute newbies in the field of programming. The set theory is the only thing in the world you need to know about to solve this problem. Everything else is cakewalk. Here’s a snippet if the code to understand the context well.

### AUTHOR’S AND TESTER’S SOLUTIONS:

Author’s solution can be found here.

Tester’s solution can be found here.