2024-2025 Russia Team Open, High School Programming Contest (VKOSHP XXV)
12 problems from 2024-2025 Russia Team Open, High School Programming Contest (VKOSHP XXV) (contest 105617), difficulty -. 9/12 solutions verified against sample I/O.
2024-2025 Russia Team Open, High School Programming Contest (VKOSHP XXV)
Special | 12 problems | 9/12 verified | Difficulty - | 11m 2s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | Colony of Bacteria | 1m 13s | ✓ | |||
| B | Two-Story Advent Calendar | 39s | ||||
| C | Intermediate Verticality | 55s | ✓ | |||
| D | Two Arrays | 55s | ✓ | |||
| E | Classics | 56s | ✓ | |||
| F | Exchange and Deletion | 33s | ||||
| G | M-11 Highway | 58s | ✓ | |||
| H | Exploration Robots | 2m 1s | ||||
| I | Prank | 53s | ✓ | |||
| J | Nightmare Sum | 39s | ✓ | |||
| K | Petya's Cryptography | 40s | ✓ | |||
| L | Two Scooters | 40s | ✓ |
CF 105617J - Nightmare Sum
We are given a sequence of distinct positive integers. The task is to look at every contiguous subarray and, for each one, take the value obtained by dividing its maximum element by its minimum element using integer division. We then sum these values over all subarrays.
CF 105617L - Two Scooters
There are two different “movement modes” in this problem: walking from home and riding a scooter after reaching it. Walking is slow but always available, while scooters are faster but must be physically reached first. We start at the origin in the plane.
CF 105617H - Exploration Robots
Sure. Please provide the Codeforces problem statement (and ideally constraints, examples, and any known tags if available).
CF 105617K - Petya's Cryptography
We are given a tree-based cryptography scheme where the public key consists of two numbers, the number of vertices in a tree and the number of length-2 paths inside it.
CF 105617I - Prank
We are given two strings for each test case, representing a word that was originally built from letter blocks and another word that appears after some mischievous modifications.
CF 105617G - M-11 Highway
We are given a sequence of points placed on a straight line in increasing order of coordinate. Each point is either a gas station or a rest area. We are also given a maximum allowed distance d.
CF 105617E - Classics
We are given a process that builds an array step by step. At the start the array is empty, and then numbers from 1 to n are inserted one by one in increasing order of value.
CF 105617F - Exchange and Deletion
Sure. Please provide the Codeforces problem statement (or a link, title, and constraints), and I’ll write a competitive programming editorial with: - Problem intuition - Key observations - Derivation of the algorithm - Proof of correctness - Complexity analysis -…
CF 105617D - Two Arrays
We are given two integer arrays of equal length. In a single operation, we pick one position and increment both arrays at that same index. So every operation “pushes” one chosen position upward in both arrays simultaneously, while all other positions stay unchanged.
CF 105617A - Colony of Bacteria
The colony starts as a single occupied cell on an infinite grid. After that, it grows once every second. During even seconds, every cell spreads to all eight neighboring positions, including diagonals. During odd seconds, it only spreads to the four cells sharing a side.
CF 105617C - Intermediate Verticality
We are given a tree with N nodes. One node is fixed as the root. Each node has a “depth level” defined as its distance from the root in terms of number of edges. So the root is at level 0, its neighbors are at level 1, and so on.