Project Euler #31

Tree.py

def Tree3(s, p, c, L):
    # attempts the same as &Tree and &Tree2 with a different approach
    # this assumes that p is ordered from smallest to highest
    res = 0
    lfinal = set()
    for i in range(len(p)):
        pos = [L]
        tSum = c
        while tSum < s:
            pos.append(pos[-1]+[p[i]])
            tSum += p[i]
        for j in pos:
            jSum = sum(j)
            if jSum > s: continue
            elif jSum == s:
                res += 1
                lfinal.add(n_from_l(j))
            else:
                n = Tree3(s, p[i+1:], jSum, j)
                res += n[0]
                for k in sorted(n[1]): lfinal.add(k)
    return len(lfinal), lfinal
  
# ans = Tree3(200, [1, 2, 5, 10, 20, 50, 100, 200], 0, []) # at least 5 min of waiting
# print(ans[0])