题解 | #24点游戏算法#

def f(l):
    if len(l) == 1:
        return l[0] == 24
    else:
        for i in range(len(l)):
            m = l.copy()
            m.pop(i)
            for j in range(len(m)):
                n = m.copy()
                n.pop(j)
                if m[j] == 0:
                    continue
                else:
                    a = l[i]+m[j]
                    b = l[i]-m[j]
                    c = l[i]*m[j]
                    d = l[i]/m[j]
                if f(n+[a]) or f(n+[b]) or f(n+[c]) or f(n+[d]):
                    return True

l = list(map(int, input().split()))
if f(l):
    print('true')
else:
    print('false')