Recursion Code

question.py

example = [[[10, 20], [10, 10]], 40]


def solve(list, index, sum, item_desired_value):
  print(list, index, sum, item_desired_value)
  if index >= len(list):
    return sum == 0

  item = list[index]

  if isinstance(item, int):
    if item != item_desired_value:
      return False
    return solve(list, index + 1, sum - item_desired_value, item_desired_value)
  else:
    is_divisioned = solve(item, 0, item_desired_value,
                          item_desired_value / len(item))
    if not is_divisioned:
      return False
    return solve(list, index + 1, sum - item_desired_value, item_desired_value)


def main(list, total):
  return solve(list, 0, total, total / len(list))


print(main(example, 80))