codemicro/adventOfCode
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

Code formatting

Browse source
This commit is contained in:
akp 2023-12-06 12:18:23 +00:00
parent 2711f12099
commit 8766669602
No known key found for this signature in database
GPG key ID: CF8D58F3DEB20755
1 changed files with 12 additions and 6 deletions
Download patch file Download diff file Expand all files Collapse all files

18
challenges/2023/06-waitForIt/main.py
View file

@ -8,16 +8,19 @@ Race = tuple[int, int]
def parse(instr: str) -> list[Race]:
times, distances = [[int(y) for y in x.split(":")[1].split(" ") if y != ""] for x in instr.splitlines()]
times, distances = [
[int(y) for y in x.split(":")[1].split(" ") if y != ""]
for x in instr.splitlines()
]
return list(zip(times, distances))
def solve_quadratic(a: int, b: int, c: int) -> list[float]:
# This doesn't handle less than 2 solutions because we're assuming that AoC
# isn't (completely) evil
res = []
res.append((-b + math.sqrt((b**2) - (4*a*c)))/2*a)
res.append((-b - math.sqrt((b**2) - (4*a*c)))/2*a)
res.append((-b + math.sqrt((b**2) - (4 * a * c))) / 2 * a)
res.append((-b - math.sqrt((b**2) - (4 * a * c))) / 2 * a)
return res
@ -40,7 +43,10 @@ def one(instr: str):
def two(instr: str):
races = parse(instr)
race = tuple(int(reduce(lambda x, y: x + str(y), [race[i] for race in races], "")) for i in range(2))
race = tuple(
int(reduce(lambda x, y: x + str(y), [race[i] for race in races], ""))
for i in range(2)
)
return solve_races([race])
@ -57,4 +63,4 @@ if __name__ == "__main__":
if sys.argv[1] == "1":
print(one(inp))
else:
print(two(inp))
print(two(inp))