Description
Topics: Segment tree, Binary Indexed Tree (BIT), Fenwick tree.
Note: For Problem B, Python may be too slow for the time limit.
Start & End Times
| Flexible Start Time |
2023-03-22 00:30
- 2023-03-29 01:30 CEST |
| End time | 2023-03-29 01:30 CEST |
Problems
| Label | Problem |
|---|---|
| A | Quick Estimates |
| B | Fenwick Tree |
| C | Ultra-QuickSort |
| D | Common Factors |
| E | Entertainment Box |
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 60 Algol 68 APL Bash BCPL BQN C C# C++ COBOL Common Lisp Crystal D Dart Elixir Erlang F# Forth Fortran Fortran 77 Gerbil Go Haskell Icon Java JavaScript (Node.js) JavaScript (SpiderMonkey) Julia Kotlin Lua Modula-2 Nim Objective-C OCaml Octave Odin Pascal Perl PHP PL/I Prolog Python 2 Python 3 Racket Ruby Rust Simula 67 Smalltalk SNOBOL Swift TypeScript Visual Basic Zig