仅使用奇数和最多N个数字来查找一个数的所有分解

def find_odd_decompositions(target, N):
    def backtrack(start, target, path, used):
        if target == 0 and len(path) <= N:
            result.append(path[:])
            return
        if target < 0 or len(path) > N:
            return
        for i in range(start, target + 1, 2):  # 只遍历奇数
            path.append(i)
            backtrack(i, target - i, path, used + [i])
            path.pop()

    result = []
    backtrack(1, target, [], [])
    return result

# 示例使用
target_number = 10
max_numbers = 3
decompositions = find_odd_decompositions(target_number, max_numbers)
print(f"所有分解为 {target_number} 的组合（最多使用 {max_numbers} 个奇数）：")
for dec in decompositions:
    print(dec)