Description
Brute Force Search
Searches and Brute Force Problems
Problems
- Easy (A-C)
- Medium (D-F)
- Hard (G-H)
Start & End Times
| Start Time | 2025-04-02 00:30 CEST |
| End time | 2025-04-09 00:00 CEST |
Problems
| Label | Problem |
|---|---|
| A | Disc District |
| B | Sun and Moon |
| C | Natjecanje |
| D | Knight Search |
| E | Peg Game for Two |
| F | Knights in Fen |
| G | Loopy Transit |
| H | Cranes |
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