Description
bfs or dfs, or something else that is simpler (e.g. kitten and flying safely) can work for most of these. Several problems can be solved using flood fill with dfs.
For 10 Kinds of People, dfs can be used as part of an algorithm. See this problem in vol. 1 of the textbook and also see the hint. Similarly see textbook for coast.
Start & End Times
| Start Time | 2024-09-24 09:18 CEST |
| End time | 2024-10-01 09:18 CEST |
Problems
| Label | Problem |
|---|---|
| A | Grid |
| B | Torn To Pieces |
| C | Flying Safely |
| D | Kitten on a Tree |
| E | 10 Kinds of People |
| F | Button Bashing |
| G | Coast Length |
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 3 Racket Ruby Rust Simula 67 Smalltalk SNOBOL Swift TypeScript Visual Basic Zig