Moscow team school olympiad (MKOSHP) 2025

12 problems from Moscow team school olympiad (MKOSHP) 2025 (contest 106141), difficulty -. 12/12 solutions verified against sample I/O.

12 items

Moscow team school olympiad (MKOSHP) 2025

Special | 12 problems | 12/12 verified | Difficulty - | 12m 21s

#	Problem	Time	✓
A	Stones and Bananas	1m 11s	✓
B	Code Lock	1m 20s	✓
C	Good Colorings -- 7	55s	✓
D	How to Annoy a Turtle	52s	✓
E	Fight Club	1m 7s	✓
F	Arsen and Toy Soldiers	52s	✓
G	Geometry!	1m 13s	✓
H	Tram System	1m 4s	✓
I	Rick's Grades	53s	✓
J	Exercise for Dania	1m 9s	✓
K	Squirrel and Steps	50s	✓
L	Vector Magic	55s	✓

Practice › Codeforces Solutions › Moscow team school olympiad (MKOSHP) 2025 ›

CF 106141D - How to Annoy a Turtle

We are given a rectangular grid of size $h times w$. A token starts at the top-left cell $(1,1)$ and wants to reach the bottom-right cell $(h,w)$. Movement is constrained to only go right or down, so every valid path is a monotone path in the grid.

Practice › Codeforces Solutions › Moscow team school olympiad (MKOSHP) 2025 ›

CF 106141H - Tram System

We are given an $n times n$ grid of lowercase letters. This grid is not static: it is overlaid by several independent cyclic “tram rings” that follow nested square paths. Each ring behaves like a circular sequence, and each ring can be rotated independently by any amount.

Practice › Codeforces Solutions › Moscow team school olympiad (MKOSHP) 2025 ›

CF 106141J - Exercise for Dania

We are given an array and for every prefix of this array we must compute a value formed from all unordered pairs inside that prefix.

Practice › Codeforces Solutions › Moscow team school olympiad (MKOSHP) 2025 ›

CF 106141F - Arsen and Toy Soldiers

We are working with a lineup of n soldiers. Each soldier is associated with two assignments: one for the morning formation and one for the evening formation. Each assignment is a number between 1 and n representing a rifle type, except some entries are unknown and marked as −1.

Practice › Codeforces Solutions › Moscow team school olympiad (MKOSHP) 2025 ›

CF 106141L - Vector Magic

We are given an array of integers $a1, a2, dots, an$. For each position we must choose a value $bi$ from the restricted set ${-3, -1, 1, 3}$.

Practice › Codeforces Solutions › Moscow team school olympiad (MKOSHP) 2025 ›

CF 106141A - Stones and Bananas

We are given an $n times n$ grid where some cells contain stones and exactly two special cells contain bananas. The grid is not just a static picture: stones can be moved, but only up to $k$ stones may be relocated, and $k le 5$, which is the crucial limitation.

Practice › Codeforces Solutions › Moscow team school olympiad (MKOSHP) 2025 ›

CF 106141K - Squirrel and Steps

We are tracking a very unusual climb. Instead of a single position moving up a staircase, we have four distinguishable paws of a cat, each sitting on integer steps. The cat starts with all four paws at position 0, and wants to end with all four paws at position n.

Practice › Codeforces Solutions › Moscow team school olympiad (MKOSHP) 2025 ›

CF 106141I - Rick's Grades

We are given two sequences of the same length. One sequence represents Morty’s grades over n days, the other represents Rick’s grades over the same days. Each grade is an integer from 0 to 5, where 0 is a special value meaning absence.

Practice › Codeforces Solutions › Moscow team school olympiad (MKOSHP) 2025 ›

CF 106141G - Geometry!

Each input object is a convex polygon described not by vertices but by its directed edges in counterclockwise order.

Practice › Codeforces Solutions › Moscow team school olympiad (MKOSHP) 2025 ›

CF 106141E - Fight Club

We are given an array of distinct strengths representing gorillas positioned in a line. A segment $[l, r]$ is considered valid if the two strongest gorillas inside that segment sit exactly at the ends of the segment, meaning no interior element is larger than either endpoint.

Practice › Codeforces Solutions › Moscow team school olympiad (MKOSHP) 2025 ›

CF 106141B - Code Lock

We are given a row of independent rotors. Each rotor stores a value that wraps around, so rotor i behaves like a number on a circle from 0 to mi - 1. The system starts with every rotor at zero, and we want to reach a target configuration b.

Practice › Codeforces Solutions › Moscow team school olympiad (MKOSHP) 2025 ›

CF 106141C - Good Colorings -- 7

We are given an $n times n$ grid where each cell is already colored either red, blue, or white. White cells are flexible, we are allowed to repaint each of them independently into either red or blue. Blue and red cells that are already fixed must stay unchanged.