Enable Javascript in your browser and then refresh this page, for a much enhanced experience.
First solution in Creative category for Golden Pyramid by Gamadzila
def checkio(data,gold,row,direct):
if row >= len(data): return gold
return max([gold + checkio(data,data[row][el],row+1,(el,el+1)) for el in direct])
def count_gold(data):
return checkio(data,data[0][0],1,(0,1))
April 30, 2014