##递归实现组合数枚举
ans = [0] * 25
n , m = input().split()
n = int(n); m = int(m)
def dfs(u, k):
    if u == m :
        for i in range(0,m):
            print(ans[i], end=' ')
        print()
        return 
    if k > n :
        return 
    ans[u] = k
    dfs(u+1, k+1);
    dfs(u,k+1);
dfs(0,1)


##递归实现排列数枚举
ans = [0] * 10
st = [0] * 10
n = int(input())
def dfs(u):
    if u == n:
        for i in range(n):
            print(ans[i], end=' ')
        print()
        return 

    for i in range(1,n+1):
        if st[i] == 0 :
            ans[u] = i
            st[i] = 1
            dfs(u+1)
            st[i] = 0
            ans[u] = 0
dfs(0)

##利用python的库函数实现排列数枚举
from itertools import permutations
n = int(input())
for p in permutations(range(1, n + 1)):
    print(*p)

##利用python的库函数实现组合数枚举
from itertools import combinations
n , k = list(map(int, input().split()))
for comb in combinations(range(1, n + 1), k):
    print(*comb)

—— 本文来自火龙信奥（义乌睿码科技）：义乌青少年信息学奥赛与编程教育平台，专注 CSP-J/S、NOIP、GESP 竞赛培训，线上线下融合教学，助力编程升学。网址：hlcoding.com