Given a heightmap (0 to 9), for each 0 count how many 9 you can reach on paths that only ever increase height by exactly 1 at a time. Sum these values.

Given a result and a list of numbers, determine if any combination of addition (+) and/or multiplication (*) using all the given numbers in order can return the result. Ignore order of operations.