Description
These problems can be solved in Java using HashMap, HashSet (though other approaches are possible):
- babelfish: HashMap
- everywhere: HashSet
- addingwords: >= 1 HashMaps
Start & End Times
| Start Time | 2025-04-18 23:59 CEST |
| End time | 2025-04-25 23:59 CEST |
Problems
| Label | Problem |
|---|---|
| A | I've Been Everywhere, Man |
| B | Babelfish |
| C | Adding Words |
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