获取列表中项目的所有组合，同时禁止某些项目组合在一起

def get_combinations(projects, banned_combinations):
    combinations = []
    backtrack(projects, banned_combinations, [], combinations)
    return combinations

def backtrack(projects, banned_combinations, current_combination, combinations):
    # 判断当前组合是否包含被禁止的项目组合
    for banned_combination in banned_combinations:
        if set(banned_combination).issubset(set(current_combination)):
            return

    # 将当前组合添加到结果列表中
    combinations.append(current_combination[:])

    # 递归生成下一个项目组合
    for i in range(len(projects)):
        project = projects[i]
        if project not in current_combination:
            current_combination.append(project)
            backtrack(projects, banned_combinations, current_combination, combinations)
            current_combination.pop()

# 测试代码
projects = ['项目A', '项目B', '项目C', '项目D']
banned_combinations = [['项目A', '项目B'], ['项目C', '项目D']]

combinations = get_combinations(projects, banned_combinations)
for combination in combinations:
    print(combination)