Description
Solve any one of these.
Per Austrin’s variants (B and C, which are also on Open Kattis) have a very strict time-bound. The “nicer” version A is basically the same task but with a smoother progression (and more relaxed bounds.)
Note that the small instance (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 | 2023-09-03 08:00 CEST |
| End time | 2023-09-20 07:59 CEST |
Problems
Scoring
Partial Credit — Unranked
Explanation:
Each problem is scored, with partial credit possible. Participants are not ranked.
Results
- Results are shown without limitation.
- Only groups that have solved at least 3 problems are shown.
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