Defelo/AdventOfCode
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity

[Python/2017] Move solutions into .py files

Browse source
This commit is contained in:
Felix Bargfeldt 2023-10-29 13:29:25 +01:00
parent fbc5fda60f
commit 7b1efc0d9c
Signed by: Defelo
GPG key ID: 2A05272471204DD3
51 changed files with 1100 additions and 4546 deletions
Download patch file Download diff file Expand all files Collapse all files

38
Python/2017/16.py Normal file
View file

@ -0,0 +1,38 @@
from lib import *
input = read_input(2017, 16).strip()
p = [chr(97 + i) for i in range(16)]
for cmd in input.split(","):
if cmd[0] == "s":
n = int(cmd[1:])
p = p[-n:] + p[:-n]
elif cmd[0] == "x":
a, b = map(int, cmd[1:].split("/"))
p[a], p[b] = p[b], p[a]
elif cmd[0] == "p":
a, b = map(p.index, cmd[1:].split("/"))
p[a], p[b] = p[b], p[a]
print("".join(p))
p = [chr(97 + i) for i in range(16)]
q = p[:]
mem = []
while True:
mem.append(p[:])
for cmd in input.split(","):
if cmd[0] == "s":
n = int(cmd[1:])
p = p[-n:] + p[:-n]
elif cmd[0] == "x":
a, b = map(int, cmd[1:].split("/"))
p[a], p[b] = p[b], p[a]
elif cmd[0] == "p":
a, b = map(p.index, cmd[1:].split("/"))
p[a], p[b] = p[b], p[a]
if p == q:
break
print("".join(mem[1000000000 % len(mem)]))