Description
-
binary search (outofsorts, room painting) (Ch. 3.3)
-
dynamic programming or backtracking with pruning (beepers) (Ch. 3.5)
-
MST Prim's or Kruskal's algorithm (cats, lostmap) (Ch. 4.3)
-
prime numbers, prime factors (enlarginghashtables, pascal) (Ch. 5.3, now we are in Vol. 2)
-
Games (minimax algorithm with backtracking) (euclidsgame) (Ch. 5.7)
-
computational geometry: points (browniepoints, cursethedarkness, imperfectgps) (Ch. 7.2)
-
computational geometry: lines (unlockpattern) (Ch. 7.2)
-
computational geometry: circles (estimatingtheareaofacircle, amsterdamdistance) (Ch. 7.2)
-
computational geometry: triangles (egypt, billiard) (Ch. 7.2)
-
computational geometry: triangles+circles (cropeasy) (Ch. 7.2)
-
computational geometry: quadrilaterals (cetvrta, rectanglesurrounding) (Ch. 7.2)
-
computational geometry: polygons (convexpolygonarea, robotprotection) (Ch. 7.3)
-
computational geometry: 3D Geometry (beavergnaw, airlinehub (7.0 difficulty)) (Ch. 7.4)
Start & End Times
| Start Time | 2023-11-08 04:26 CET |
| End time | 2023-11-15 04:26 CET |
Problems
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