AcWing 1572. 递归实现指数型枚举 II
原题链接
简单
作者:
弦之森.py
,
2023-11-18 20:34:30
,
所有人可见
,
阅读 47
n=int(input())
nums=list(map(int,input().split()))
nums.insert(0,0)
# print(nums)
dnums=[0 for x in range(n+1)]
array=[]
def dfs(x):
if x>n:
numlist=[]
for y in range(1,n+1):
if dnums[y]==1:
numlist.append(nums[y])
strs=''
for z in sorted(numlist):
strs+=str(z)+' '
array.append(strs)
return
dnums[x]=1
dfs(x+1)
dnums[x]=0
dnums[x]=-1
dfs(x+1)
dnums[x]=0
dfs(1)
# print(array)
# 结果需要去重处理
for x in list(set(array)):
print(x)