2023-2024 Russia Team Open, High School Programming Contest (VKOSHP XXIV)
13 problems from 2023-2024 Russia Team Open, High School Programming Contest (VKOSHP XXIV) (contest 104872), difficulty -. 0/13 solutions verified against sample I/O.
2023-2024 Russia Team Open, High School Programming Contest (VKOSHP XXIV)
Special | 13 problems | 0/13 verified | Difficulty - | 13m 58s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | Three Suitcases | 1m 7s | ||||
| B | Cooperative Game on a Tree | 1m 38s | ||||
| C | Driving License Exam | 25s | ||||
| D | a, ab, ba Strings | 35s | ||||
| E | Casino | 30s | ||||
| F | Magic Square | 1m 19s | ||||
| G | Not Everything Is So Ambiguous | 1m 33s | ||||
| H | Scooter Numbers | 22s | ||||
| I | Squares | 1m 27s | ||||
| J | Streets of Flatland | 29s | ||||
| K | Guess the String | 2m 5s | ||||
| L | Count the Christmas Trees | 1m 16s | ||||
| M | Katya and the Broken Keyboard | 1m 12s |
CF 104872A - Three Suitcases
We are given three separate suitcases, each contributing a fixed weight to a single combined baggage check-in. The airline does not charge per suitcase, but instead looks at the total weight after everything is combined.
CF 104872J - Streets of Flatland
We are given a connected structure made of $n$ locations connected by exactly $n-1$ undirected roads, so the underlying graph is a tree.
CF 104872M - Katya and the Broken Keyboard
Katya wants to type a fixed string, but some keyboard keys behave periodically in a broken way. For each broken letter key, pressing it does not reliably produce a character every time.
CF 104872L - Count the Christmas Trees
We are asked to count a very structured family of rooted trees of height $n$. The tree is layered: the root is at layer 1, and each vertex at layer $i$ has children only in layer $i+1$.
CF 104872K - Guess the String
We are given an unknown string of length $n$, made only of the characters a, b, and c. Our task is to reconstruct it by asking queries about adjacent positions. A single query targets a position $i$ and a two-character pattern $u1u2$.
CF 104872I - Squares
We are working with an infinite integer grid where every operation adds or removes a fixed shape, namely a unit 2 by 2 block anchored at a lower-left coordinate $(x, y)$. Each query toggles the presence of such a block in a current set $S$.
CF 104872H - Scooter Numbers
We are given a fixed integer $n$. The task is to consider every way of writing $n$ as a sum of positive integers where order does not matter, so each representation is a nondecreasing sequence. Each such representation is treated as a multiset of parts.
CF 104872G - Not Everything Is So Ambiguous
We are dealing with a hidden pair of integers: a value $x$ in the range $1 le x le 10^9$, and a base $b$ in the range $2 le b le 2023$. We do not see either of them directly. Instead, we are initially told how many digits $x$ has when written in base $b$.
CF 104872F - Magic Square
We are given an $n times n$ grid that initially contains a perfect permutation of numbers from $1$ to $n^2$. The defining property of the original grid is that every row sum equals the same value, and every column sum also equals that same value.
CF 104872B - Cooperative Game on a Tree
We are given a rooted tree where every node has a single parent except the root. Two tokens start at the root: a blue token and a red token. The process unfolds in synchronized rounds.
CF 104872E - Casino
Codeforces 104872E: Casino
CF 104872D - a, ab, ba Strings
We are maintaining a binary string made only of characters a and b, with two operations applied online. The first operation flips a single position, turning a into b or b into a.
CF 104872C - Driving License Exam
We are given a path of intersections arranged in a line, where each adjacent pair is connected by a road with a certain length. Each intersection also contains some amount of “ice resource”.