<p>Given an integer array <code>nums</code>, return <em>all the different possible non-decreasing subsequences of the given array with at least two elements</em>. You may return the answer in <strong>any order</strong>.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> nums = [4,6,7,7]
<strong>Output:</strong> [[4,6],[4,6,7],[4,6,7,7],[4,7],[4,7,7],[6,7],[6,7,7],[7,7]]
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> nums = [4,4,3,2,1]
<strong>Output:</strong> [[4,4]]
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= nums.length &lt;= 15</code></li>
	<li><code>-100 &lt;= nums[i] &lt;= 100</code></li>
</ul>

#include <set>

class Solution {
public:
    vector<vector<int>> findSubsequences(vector<int>& nums) {
        set<vector<int>> res;
        for (uint32_t m = 1; m != 1 << nums.size(); ++m) {
            if (popcount(m) < 2) continue;
            vector<int> v;
            int prev = numeric_limits<int>::min();
            for (uint32_t t = m; t; t &= t-1) {
                int val = nums[countr_zero(t)];
                if (val < prev) { goto cont; }
                v.push_back(prev = val);
            }
            res.insert(std::move(v));
            cont:;
        }
        return { res.begin(), res.end() };
    }
};
58214