II Olympiad of classes at the Mechanics and Mathematics Faculty of MSU in programming 2023.
8 problems from II Olympiad of classes at the Mechanics and Mathematics Faculty of MSU in programming 2023. (contest 104336), difficulty -. 4/8 solutions verified against sample I/O.
II Olympiad of classes at the Mechanics and Mathematics Faculty of MSU in programming 2023.
Special | 8 problems | 4/8 verified | Difficulty - | 10m 24s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | Number in the Triangle | 1m 21s | ||||
| B | GCD of Substrings | 1m 8s | ✓ | |||
| C | Two players, two numbers | 57s | ✓ | |||
| D | Beautiful Roses | 1m | ✓ | |||
| E | Solve problems every day | 1m 1s | ✓ | |||
| F | Square between flowers | 1m 27s | ||||
| G | Wall reinforcement | 1m 53s | ||||
| H | Ostovok | 1m 37s |
CF 104336G - Wall reinforcement
The wall is a sequence of independent segments, each with an initial height. A monster attacks each segment separately using a fixed rule tied to a parameter $k$.
CF 104336H - Ostovok
We are given a complete graph on $n$ vertices, which means every pair of vertices is connected by an edge. From this dense structure, we are allowed to repeatedly extract spanning trees, with the restriction that once an edge is used in one chosen tree, it cannot be used again…
CF 104336F - Square between flowers
We are given a grid of size $n times m$, where each cell is colored either black or white. We can imagine the grid as a chessboard-like map of regions. The only allowed way to “draw walls” is along the boundary between two adjacent cells that have different colors.
CF 104336E - Solve problems every day
We are tracking Maxim’s daily problem solving over a sequence of $n$ days. On each day he solves at least one problem, and we want to assign an exact positive integer to each day. Two quantities are observed at every day $i$.
CF 104336D - Beautiful Roses
We are given a line of roses, each with an integer height. We are allowed to increase any individual height by 1 any number of times, and each increase costs one unit.
CF 104336A - Number in the Triangle
We are working with Pascal’s triangle, where each row is built from the previous one by adding adjacent pairs, and the edges are always 1. Each row is indexed starting from zero, and within a row, positions are also indexed from zero.
CF 104336B - GCD of Substrings
We are given a very large integer written as a string, potentially up to one million digits, and we need to compute a value defined in a non-standard way.
CF 104336C - Two players, two numbers
We are given two players, each starting with an integer written in decimal form. Arthur owns a, Nikita owns b. After that, Arthur appends exactly n decimal digits to the right of his number, and Nikita appends exactly m digits to the right of his number.