#include <iostream>

#include <vector>

#include <algorithm>

using namespace std;

class Solution {

public:

    vector<vector<int> > subsetsWithDup(vector<int> &S) {

        vector<vector<int> > ans;

        if(S.size()==)

            return ans;

        int num = pow(,S.size());

        sort(S.begin(),S.end());

        for(int i = ; i<num; i++)

        {

            vector<int> ansPiece;

            ansPiece = oneSubsetPiece(i,S);

            bool flag = ;

            for(int j = ; j<ans.size(); j++)

            {

                if(ansPiece == ans[j]) flag = ;

            }

            if(flag == )

                ans.push_back(ansPiece);

        }

        return ans;

    }

    //find the num's binary

    vector<int> oneSubsetPiece(int num,vector<int> &S)

    {

        vector<int> ansPiece;

        int YuShu;

        int ChuShu;

        int index = ;

        while(num)

        {

            YuShu = num %;

            num = num/;

            if(YuShu)

                ansPiece.push_back(S[index]);

            index++;

        }

        return ansPiece;

    }

};

int main()

{

    class Solution sol;

    vector<int> num;

    num.push_back();

    num.push_back();

    num.push_back();

    sol.subsetsWithDup(num);

}