Start & End Times
| Start Time | 2026-03-20 17:00 CET |
| Length | 35069:00:00 |
| End time | 2030-03-20 22:00 CET |
Problems
| Label | Problem |
|---|---|
| A | Useful Algorithm |
| B | Triangulation |
| C | Path Planning 2 |
| D | Minimum Spanning Tree |
| E | Colorful Segments 2 |
| F | Matrix |
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 with GMP C with Memory Check C# C++ C++ with GMP C++ with Memory Check COBOL Common Lisp Crystal D Dart Elixir Erlang F# Forth Fortran Fortran 77 Gerbil Go Haskell Icon Java Java with Algs4 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 Python 3 with NumPy Racket Ruby Rust Scala Simula 67 Smalltalk SNOBOL Swift TypeScript Uiua Visual Basic Zig