Puzzle du 13 décembre 2017
This commit is contained in:
parent
70319684ea
commit
f0abc59439
|
@ -5,5 +5,7 @@ def scanner_pos(length, time):
|
|||
return 2 * (length - 1) - offset if offset > length - 1 else offset
|
||||
|
||||
import sys
|
||||
import itertools
|
||||
ranges = {k: v for (k, v) in [tuple(map(int, l.strip().split(": "))) for l in sys.stdin.readlines()]}
|
||||
print(sum(pos * ranges[pos] for pos in ranges if scanner_pos(ranges[pos], pos) == 0))
|
||||
print(next(time for time in itertools.count() if not any(scanner_pos(ranges[pos], time + pos) == 0 for pos in ranges)))
|
||||
|
|
Loading…
Reference in New Issue