Description
You need more than 0 points in total. The easiest (and recommended) method is to solve subtask 2 of Stable Perfect Matching for 40 points.
Start & End Times
| Start Time | 2025-08-22 18:00 CEST |
| End time | 2025-09-03 07:59 CEST |
Problems
| Label | Problem |
|---|---|
| A | Stable Perfect Matching |
| B | Draft Time |
| C | Jealous Youngsters |
Scoring
Partial Credit — Unranked
Explanation:
Each problem is scored, with partial credit possible. Participants are not ranked.
Results
- Results are shown without limitation.
Languages
Ada Algol 68 APL Bash 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 Go Haskell Java Java with Algs4 JavaScript (Node.js) JavaScript (SpiderMonkey) Julia Kotlin Lua Modula-2 Nim Objective-C OCaml Octave Odin Pascal Perl PHP Prolog Python 2 Python 3 Python 3 with NumPy Racket Ruby Rust Simula 67 Smalltalk SNOBOL Swift TypeScript Visual Basic Zig