Enable Javascript in your browser and then refresh this page, for a much enhanced experience.
First solution in Uncategorized category for Ore In The Desert by Moff
import math
def checkio(previous):
if len(previous) == 0:
return [0, 0]
elif len(previous) == 1:
pi, pj, dist = previous[0]
return [min(9, dist), 0]
elif len(previous) == 2:
pi, pj, dist = previous[-1]
return [pj, min(9, dist)]
else:
s = []
for i in range(10):
for j in range(10):
if all(round(math.hypot(i - pi, j - pj)) == dist for pi, pj, dist in previous):
s.append((i, j))
return s[0]
Aug. 24, 2015
Comments:
