From 6f07da3b9d677092eb7555ba447caba5a1c1ae21 Mon Sep 17 00:00:00 2001 From: Ahmed Salah Date: Fri, 28 Jun 2024 13:06:33 +0300 Subject: [PATCH] added new easy problem from codeforces (1978B) --- src/num_methods/ternary_search.md | 1 + 1 file changed, 1 insertion(+) diff --git a/src/num_methods/ternary_search.md b/src/num_methods/ternary_search.md index 373c47142..59afaaa82 100644 --- a/src/num_methods/ternary_search.md +++ b/src/num_methods/ternary_search.md @@ -81,6 +81,7 @@ Here `eps` is in fact the absolute error (not taking into account errors due to Instead of the criterion `r - l > eps`, we can select a constant number of iterations as a stopping criterion. The number of iterations should be chosen to ensure the required accuracy. Typically, in most programming challenges the error limit is ${10}^{-6}$ and thus 200 - 300 iterations are sufficient. Also, the number of iterations doesn't depend on the values of $l$ and $r$, so the number of iterations corresponds to the required relative error. ## Practice Problems +- [Codeforces - New Bakery](https://codeforces.com/problemset/problem/1978/B) - [Codechef - Race time](https://www.codechef.com/problems/AMCS03) - [Hackerearth - Rescuer](https://www.hackerearth.com/problem/algorithm/rescuer-2d2495cb/) - [Spoj - Building Construction](http://www.spoj.com/problems/KOPC12A/)