题目描述
输入n,a,b,c,n代表柱子长度,a,b,c代表可以切割的大小。求这个竹子最多能被分成多少分(不能有剩余)
没来得及提交,如果不用回溯,用暴力会超时
思路题解
回溯法
def recall(count, base, res,s):
#base没有被压入
if count -base == 0:
print(s+str(base)+' ')
return res+1
if count - base>0:
x = recall(count - base, a, res+1,s+str(base)+' ')
if x:return x
x = recall(count - base, b, res+1,s+str(base)+' ')
if x: return x
x = recall(count - base, c, res+1,s+str(base)+' ')
if x: return x
n, a, b, c = map(int, input().split())
ls = [a, b, c]
ls.sort()
x=recall(n, a, 0,"") or recall(n, b, 0,"") or recall(n, c, 0,"")
if x:print(x)
else:print(-1)
# 97 7 16 20