Enable Javascript in your browser and then refresh this page, for a much enhanced experience.
inverted pyramid and sum solution in Clear category for Golden Pyramid by kdim
def count_gold(pyramid):
pyramid = [list(row) for row in pyramid[::-1]]
for i, row in enumerate(pyramid[1:]):
for j in range(len(row)):
row[j] += max(pyramid[i][j:j + 2])
return pyramid[-1][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"
Dec. 18, 2022
Comments: