Description
Competitive Programming 4 - Chapter 2.2
Topics
1D array manipulation, Medium
- A - D (4)
- Extra: E
1D array manipulation, Harder
- F - H (3)
- Extra: I - Q
2D array manipulation, Easier
- R - U (4)
- Extra: V, W
2D array manipulation, Harder
- X - AA (4)
- Extra: AB - AF
Sorting, Easier
- AG - AJ (4)
- Extra: AK - AM
Sorting, Harder
- AN - AQ (5)
- Extra: AR - BA
Special sorting problems
- BB - BD (3)
- Extra: BE - BI
Bit manipulation
- BJ - BM (4)
- Extra: BN - BQ
Big integer
- BR - BT (3)
- Extra: BU - BW
Stack
- BX - BZ (3)
- Extra: CA - CD
Special stack-based problems
- CE - CG (3)
List/Queue/Deque
- CH - CK (4)
- Extra: CL - CQ
Total recommended: 44
Start & End Times
| Flexible Start Time |
2024-07-03 09:00
- 2024-12-31 08:00 CET |
| End time | 2024-12-31 08:00 CET |
Problems
The contest has not yet started. The problems will become available when the contest starts.
Scoring
Partial Credit — Ranked (with tiebreaker)
Explanation:
Participants are ranked by the sum of the score of each problem. Ties are broken by the time of the last score-increasing submission
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