Description
Solve A (full points).
Per Austrin’s variants (B and C, which are also on Open Kattis) have very strict time-bounds and may require highly optimised code and not be suitable for slow-ish languages. (The algorithm is, of course, the same.)
The “nicer” version A is basically the same task but with a smoother progression (and more relaxed bounds.)
Note that the small instance (A, subtask 1) can be solved with by checking all pairs. You need that piece of code anyway for the bottom of your recursion; so it’s a good idea to solve that subtask first.
Start & End Times
| Start Time | 2025-08-26 22:00 CEST |
| End time | 2025-09-17 07:59 CEST |
Problems
Scoring
Pass/Fail — Unranked
Explanation:
Each problem is pass/fail. Participants are not ranked
Results
- Results are shown without limitation.
Languages
Ada Algol 68 APL Bash C C# C++ COBOL Common Lisp Crystal C with GMP C++ with GMP C with Memory Check C++ with Memory Check D Dart Elixir Erlang F# Forth Fortran Go Haskell Java JavaScript (Node.js) JavaScript (SpiderMonkey) Java with Algs4 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