@ -11,7 +11,7 @@ def do_task(input):
for i in range(len(times)):
a = -1
b = 1 + times[i] - 1
b = times[i]
c = -distances[i]
max_h = (-b - sqrt(b**2 - 4 * a * c)) / (2 * a)
@ -8,7 +8,7 @@ def do_task(input):
distance = int("".join(lines[1].split()[1:]))
b = 1 + time - 1
b = time
c = -distance