Description
Binary and Ternary Search
Binary search is an algorithm for quickly finding values in sorted lists. The closely related ternary search works much in the same way but can find local minima/maxima. For full details please check out these articles:
Start & End Times
| Start Time | 2025-10-29 23:00 CET |
| End time | 2025-11-05 23:00 CET |
Problems
| Label | Problem |
|---|---|
| A | Jewelry Box |
| B | Out of Sorts |
| C | Kattis's Quest |
| D | Reconnaissance |
| E | Financial Planning |
Scoring
Pass/Fail — Ranked
Explanation:
Each problem is pass/fail. Participants are ranked by the number of solved problems, breaking ties by penalty (sum of time + 20 minutes per wrong submission, for all solved problems). Time is rounded to minutes.
Standings
- Standings are shown without limitation.
Languages
Ada Algol 60 Algol 68 APL Bash BCPL BQN C C# C++ COBOL Common Lisp Crystal D Dart Elixir Erlang F# Forth Fortran Fortran 77 Gerbil Go Haskell Icon Java JavaScript (Node.js) JavaScript (SpiderMonkey) Julia Kotlin Lua Modula-2 Nim Objective-C OCaml Octave Odin Pascal Perl PHP PL/I Prolog Python 2 Python 3 Racket Ruby Rust Simula 67 Smalltalk SNOBOL Swift TypeScript Visual Basic Zig