Start & End Times
| Flexible Start Time |
2025-04-04 20:00
- 2025-04-11 20:00 CEST |
| End time | 2025-04-11 20:00 CEST |
Problems
| Label | Problem |
|---|---|
| A | Grab a Graph |
| B | Conquest Campaign |
| C | Wheels |
| D | Traveling Merchant |
| E | Nine Packs |
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 2 Python 3 Racket Ruby Rust Simula 67 Smalltalk SNOBOL Swift TypeScript Visual Basic Zig