Отбор на ВКОШП.Junior 2026

10 problems from Отбор на ВКОШП.Junior 2026 (contest 106398), difficulty -. 9/10 solutions verified against sample I/O.

10 items

Отбор на ВКОШП.Junior 2026

Special | 10 problems | 9/10 verified | Difficulty - | 13m 35s

#	Problem	Time	✓
A	\u0425\u043e\u043c\u044f\u043a\u0438 \u0438 \u0448\u0430\u0445\u043c\u0430\u0442\u044b	53s	✓
B	\u0423\u0442\u0440\u0435\u043d\u043d\u044f\u044f \u043f\u0435\u0441\u043d\u044f \u0445\u043e\u043c\u044f\u043a\u043e\u0432	49s	✓
C	\u0417\u0430\u0440\u044f\u0434\u043a\u0430 \u0434\u043b\u044f \u0445\u043e\u043c\u044f\u043a\u043e\u0432	42s	✓
D	\u0425\u043e\u043c\u044f\u0447\u044c\u0438 \u0431\u0435\u0433\u0430	1m 4s	✓
E	\u041b\u0430\u0431\u0438\u0440\u0438\u043d\u0442 \u0434\u043b\u044f \u0445\u043e\u043c\u044f\u043a\u0430	46s	✓
F	\u041f\u0435\u0440\u0435\u0445\u043e\u0434\u044b \u0432 \u0425\u043e\u043c\u043e\u043f\u043e\u043b\u0438\u0441\u0435	55s	✓
G	\u0412\u0430\u0441\u044f \u0438 \u0442\u0440\u0435\u043d\u0438\u0440\u043e\u0432\u043a\u0438	46s	✓
H	\u0412\u0435\u0442\u0435\u0440 \u043a\u0440\u0435\u043f\u0447\u0430\u0435\u0442	1m 33s	✓
I	\u0421\u043b\u043e\u043c\u0430\u043d\u043d\u0430\u044f \u043c\u0430\u0442\u0440\u0438\u0446\u0430	5m 20s
J	\u041f\u0440\u0438\u0437\u0440\u0430\u0447\u043d\u0430\u044f \u043e\u0447\u0435\u0440\u0435\u0434\u044c	47s	✓

Practice › Codeforces Solutions › Отбор на ВКОШП.Junior 2026 ›

CF 106398C - Зарядка для хомяков

We are given a row of $N$ hamsters, where $N$ is even. Each hamster is in one of two states: standing or sitting, encoded as characters X and x. In one move, we can pick a single hamster and flip its state.

Practice › Codeforces Solutions › Отбор на ВКОШП.Junior 2026 ›

CF 106398I - Сломанная матрица

Codeforces 106398I: Сломанная матрица

Practice › Codeforces Solutions › Отбор на ВКОШП.Junior 2026 ›

CF 106398E - Лабиринт для хомяка

We are given a rectangular grid of size $N times M$. Inside this grid, we build a structure made of concentric rectangular “rings”.

Practice › Codeforces Solutions › Отбор на ВКОШП.Junior 2026 ›

CF 106398G - Вася и тренировки

We are given a sequence of scheduled training sessions. Ideally, there are $n$ sessions, but Vasya may skip some of them. Every skipped session is not lost: it must be compensated later at a future visited session.

Practice › Codeforces Solutions › Отбор на ВКОШП.Junior 2026 ›

CF 106398J - Призрачная очередь

We are given a line of spirits standing in a queue, each with an initial height. Two observers look at this queue from opposite ends, but each of them has a very specific visibility rule.

Practice › Codeforces Solutions › Отбор на ВКОШП.Junior 2026 ›

CF 106398B - Утренняя песня хомяков

We are given a long uppercase string that represents a recording of a choir performance. Each hamster in the choir has a unique “song”, and each song is exactly two characters long.

Practice › Codeforces Solutions › Отбор на ВКОШП.Junior 2026 ›

CF 106398H - Ветер крепчает

We are given a line of towers, each with a fixed height. Then we process a sequence of wind experiments. Each experiment starts at some position and moves strictly to the right. The wind carries a strength value that decreases as it passes towers.

Practice › Codeforces Solutions › Отбор на ВКОШП.Junior 2026 ›

CF 106398D - Хомячьи бега

We are given a rectangular grid of size $N times M$. A hamster starts at the top-left cell and moves diagonally down-right at a 45-degree angle, marking every visited cell.

Practice › Codeforces Solutions › Отбор на ВКОШП.Junior 2026 ›

CF 106398F - Переходы в Хомополисе

We are given two permutations of the numbers from 1 to N, written as two rows of a city layout. Each number represents a temperature zone, and every zone appears exactly once on each side.

Practice › Codeforces Solutions › Отбор на ВКОШП.Junior 2026 ›

CF 106398A - Хомяки и шахматы

We are given two piles of tiles, one pile contains white tiles and the other contains black tiles. The goal is to assemble the largest possible square chessboard using these tiles, with the additional constraint that the final board must follow a standard chess coloring rule…