题解 | #24点游戏算法#

flag = 0 def dfs(nums, track, sums): global flag if 0 not in track and sums == 24: flag = 1 return

for i in range(len(nums)):
    #print(2,i)
    if track[i] == 0:
        track[i] = 1
        dfs(nums, track, sums + nums[i])
        dfs(nums, track, sums - nums[i])
        dfs(nums, track, sums * nums[i])
        dfs(nums, track, sums / nums[i])
        track[i] = 0

while True: try: nums = list(map(int,input().split())) track = [0,0,0,0] dfs(nums,track,0) if flag: print('true') else: print('false')

except:
    break