ettore.dreucci/AdventOfCode
1
0
Fork 0
mirror of https://github.com/Noettore/AdventOfCode.git synced 2025-10-15 11:46:39 +02:00
Code Issues Packages Projects Releases Wiki Activity

AoC 2020: day5: power of two multiplication

Browse Source 
Signed-off-by: Ettore Dreucci <ettore.dreucci@gmail.com>
This commit is contained in:
Ettore Dreucci
2020-12-05 15:23:08 +01:00
parent 529c482d61
commit a7dee4f9db
1 changed files with 1 additions and 6 deletions
Download Patch File Download Diff File Expand all files Collapse all files

7
2020-python/solutions/day_5.py
View File

@@ -10,15 +10,11 @@ def read_input(input_path: str) -> list:
seats = list()
for entry in entries:
entry = entry.strip()
row = ''.join(['0' if letter == 'F' else '1' for letter in entry[:7]])
column = ''.join(['0' if letter == 'L' else '1' for letter in entry[-3:]])
seat = int(row, 2) * 8 + int(column, 2)
seat = int(''.join(['0' if letter in 'FL' else '1' for letter in entry]), 2)
seats.append(seat)
seats.sort()
return seats
def part1(entries: list) -> int:
"""part1 solver take a list of strings and return an int"""
return max(entries)
@@ -39,6 +35,5 @@ def main():
end_time = time.time()
print("Execution time: %f" % (end_time-start_time))
if __name__ == "__main__":
main()