Enable Javascript in your browser and then refresh this page, for a much enhanced experience.
First solution in Clear category for Golden Pyramid by cwahbong
import itertools
def max_combine(l1, l2):
return map(max, itertools.zip_longest(l1, l2, fillvalue=0))
def sum_combine(l1, l2):
return map(sum, itertools.zip_longest(l1, l2, fillvalue=0))
def count_gold(pyramid):
buffer = []
for line in reversed(pyramid):
buffer = list(sum_combine(buffer, line))
buffer = list(max_combine(buffer, buffer[1:]))
return buffer[0]
if __name__ == '__main__':
#These "asserts" using only for self-checking and not necessary for auto-testing
assert count_gold((
(1,),
(2, 3),
(3, 3, 1),
(3, 1, 5, 4),
(3, 1, 3, 1, 3),
(2, 2, 2, 2, 2, 2),
(5, 6, 4, 5, 6, 4, 3)
)) == 23, "First example"
assert count_gold((
(1,),
(2, 1),
(1, 2, 1),
(1, 2, 1, 1),
(1, 2, 1, 1, 1),
(1, 2, 1, 1, 1, 1),
(1, 2, 1, 1, 1, 1, 9)
)) == 15, "Second example"
assert count_gold((
(9,),
(2, 2),
(3, 3, 3),
(4, 4, 4, 4)
)) == 18, "Third example"
Aug. 22, 2014
