Description
Binary and Ternary Search
Problems:
- A-C (Easy)
- D-G (Medium)
- H-I (Hard)
CPSC 599.4: Each Easy problem will be worth 1 point, each Medium problem 3 and each Hard problem 5. Get at least 10 points
Start & End Times
| Start Time | 2025-02-12 00:30 CET |
| End time | 2025-02-19 00:30 CET |
Problems
| Label | Problem |
|---|---|
| A | Guess the Number |
| B | Cantor |
| C | Tram |
| D | Small Schedule |
| E | H-Index |
| F | Traveling Monk |
| G | Zipline |
| H | Trick or Treat |
| I | 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 68 APL Bash C C# C++ COBOL Common Lisp Crystal D Dart Elixir Erlang F# Forth Fortran Go Haskell Java JavaScript (Node.js) JavaScript (SpiderMonkey) Julia Kotlin Lua Modula-2 Nim Objective-C OCaml Octave Odin Pascal Perl PHP Prolog Python 3 Racket Ruby Rust Simula 67 Smalltalk SNOBOL Swift TypeScript Visual Basic Zig