Municipal stage of the All-Russian School Olympiad in Informatics in the Vologda Region 2023, grades 9-11
0 problems from Municipal stage of the All-Russian School Olympiad in Informatics in the Vologda Region 2023, grades 9-11 (contest 104852), difficulty -. 0/0 solutions verified against sample I/O.
Municipal stage of the All-Russian School Olympiad in Informatics in the Vologda Region 2023, grades 9-11
Special | 0 problems | 0/0 verified | Difficulty - |
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| (none) |
CF 1048525 - Symmetric Sequences
We are asked to count certain well-formed bracket strings of length 2n. These strings behave like standard valid parentheses sequences, meaning every prefix never has more closing brackets than opening ones, and the total number of opening and closing brackets is equal.
CF 1048522 - Vocabulary
We are building words of fixed length $N$ using a very small alphabet consisting of exactly three symbols: $a$, $o$, and $c$. A word is simply a length-$N$ string over these three characters.
CF 1048524 - Fun Numbers
We are given a single non-negative integer $n$, and we are asked to count how many unordered pairs of non-negative integers $(a, b)$ satisfy $a + b = n$, under a special restriction: both $a$ and $b$ must be “fun”.
CF 1048521 - Rhombic Order
We are given a grid with a special numbering rule: the integer 1 sits at the origin, and numbers expand outward in layers shaped like diamonds.
CF 1048523 - Business Trips
We are given a list of scheduled business trips for an employee. Each trip occupies a continuous interval of days and specifies a city.