mirror of
https://github.com/bvanroll/advent-of-code-2020.git
synced 2025-08-29 12:02:44 +00:00
started a little late today, however this one was really fun so far.
This commit is contained in:
26
05/main.py
Normal file
26
05/main.py
Normal file
@@ -0,0 +1,26 @@
|
||||
# doing python again because i want to :^)
|
||||
|
||||
lines = open("input.txt").read().split("\n")
|
||||
|
||||
|
||||
#i will use this if i ever need it, for now it's faster to not use it
|
||||
#scores = []
|
||||
|
||||
lastScore = 0
|
||||
|
||||
|
||||
# its binary, time to understand bitshifting
|
||||
|
||||
|
||||
|
||||
for line in lines:
|
||||
if len(line) > 3: #idk i picked 3 just cuz, sometimes python just has empty string after split
|
||||
b = int(line.lower().replace("f", "0").replace("b","1").replace("l","0").replace("r","1"), 2)
|
||||
row = b >> 3
|
||||
col = b & int("0000000111", 2) # idk if you can do this with bitshifting too, this felt kinda cheap
|
||||
score = row * 8 + col
|
||||
if score > lastScore:
|
||||
lastScore = score
|
||||
|
||||
print(lastScore)
|
||||
|
Reference in New Issue
Block a user