fix binsearch bounds

glguy · Dec 6, 2023 · 887aa42 · 887aa42
1 parent 26044ff
commit 887aa42
Showing 1 changed file with 2 additions and 2 deletions.
diff --git a/solutions/src/2023/06.hs b/solutions/src/2023/06.hs
@@ -40,8 +40,8 @@ ways (t, d) = hi - lo + 1
   where
     valid hold = (t - hold) * hold > d
     mid = t `div` 2 -- the midpoint is the best we can get
-    lo = binSearch (not . valid) 0 (mid + 1) + 1
-    hi = binSearch valid lo t
+    lo = binSearch (not . valid) 0 mid + 1
+    hi = binSearch valid mid t
 
 binSearch ::
   (Int -> Bool) {- ^ predicate    -} ->