Partie 1 du puzzle du 20 décembre
This commit is contained in:
parent
87ed25ca64
commit
9f27b0d348
|
@ -0,0 +1,20 @@
|
|||
#!/usr/bin/env python3
|
||||
|
||||
def man_dist(tup):
|
||||
return abs(tup[0]) + abs(tup[1]) + abs(tup[2])
|
||||
|
||||
import sys
|
||||
import re
|
||||
pattern = re.compile(r"<([0-9-]*),([0-9-]*),([0-9-]*)>")
|
||||
data = [[(int(c[0]), int(c[1]), int(c[2])) for c in p] for p in [pattern.findall(l.strip()) for l in sys.stdin.readlines()]]
|
||||
|
||||
while True:
|
||||
for i in range(len(data)):
|
||||
data[i][0] = tuple(data[i][0][k] + data[i][1][k] for k in range(len(data[i][0])))
|
||||
data[i][1] = tuple(data[i][1][k] + data[i][2][k] for k in range(len(data[i][1])))
|
||||
|
||||
min_dist, min_p = None, None
|
||||
for i in range(len(data)):
|
||||
if min_p is None or man_dist(data[i][0]) < min_dist:
|
||||
min_p, min_dist = i, man_dist(data[i][0])
|
||||
print(min_p)
|
Loading…
Reference in New Issue