如何计算大于c的列表的所有可能子集

def find_subsets_greater_than_c(nums, c):
    # Step 1: Filter elements greater than c
    filtered_nums = [num for num in nums if num > c]
    
    subsets = []
    n = len(filtered_nums)
    
    # Step 2: Generate binary numbers
    for i in range(2**n):
        subset = []
        
        # Step 3: Select elements based on binary number
        for j in range(n):
            if (i >> j) & 1:
                subset.append(filtered_nums[j])
        
        # Step 4: Add subset to result
        subsets.append(subset)
    
    return subsets