Enable Javascript in your browser and then refresh this page, for a much enhanced experience.
One liner 2nd solution in Creative category for Golden Pyramid by Sim0000
count_gold=f=lambda p,n=0,x=0:n!=len(p)and p[n][x]+max(f(p,n+1,x+d)for d in(0,1))
# One liner revised
"""
# decrypted version
def count_gold(pyramid):
def f(level, pos):
if level == len(pyramid):
return 0
return pyramid[level][pos] + max(f(level + 1, pos + d) for d in (0, 1))
return f(0, 0)
"""
May 1, 2014
Comments:
