Финал ВКОШП.Junior 2025

12 problems from Финал ВКОШП.Junior 2025 (contest 105828), difficulty -. 12/12 solutions verified against sample I/O.

12 items

Финал ВКОШП.Junior 2025

Special | 12 problems | 12/12 verified | Difficulty - | 11m 4s

#	Problem	Time	✓
A	\u0411\u0435\u0441\u043a\u043e\u043d\u0435\u0447\u043d\u0430\u044f \u0438\u0433\u0440\u0430	46s	✓
B	\u0421\u0442\u0440\u043e\u043a\u0438 \u0438 \u0441\u0442\u043e\u043b\u0431\u0446\u044b	58s	✓
C	\u0426\u0432\u0435\u0442\u044b-\u043c\u0443\u0442\u0430\u043d\u0442\u044b	46s	✓
D	\u041e\u043f\u044f\u0442\u044c \u0441\u0435\u043a\u0440\u0435\u0442\u0438\u043a\u0438	47s	✓
E	\u041f\u0440\u043e\u0441\u0442\u043e\u0439 \u043a\u0430\u0440\u0430\u043d\u0434\u0430\u0448	49s	✓
F	\u0418\u0441\u0442\u043e\u0440\u0438\u044f \u043e \u044e\u043d\u043e\u0448\u0435, \u0438\u0437\u0443\u0447\u0430\u0432\u0448\u0435\u043c \u043c\u0430\u0442\u0435\u043c\u0430\u0442\u0438\u043a\u0443, \u043a\u043e\u0433\u0434\u0430 \u043f\u043e\u043f\u0430\u043b \u0432 \u0434\u0440\u0443\u0433\u043e\u0439 \u043c\u0438\u0440	1m 5s	✓
G	\u0412\u0440\u0435\u043c\u044f \u0447\u0438\u0442\u0430\u0442\u044c \u043a\u043d\u0438\u0433\u0438	1m 14s	✓
H	\u0412\u0441\u0435 \u043d\u0430 \u0432\u0435\u0441\u0435\u043d\u043d\u0438\u0439 \u0431\u0430\u043b!	47s	✓
I	\u0423\u0447\u0435\u0431\u043d\u044b\u0435 \u0433\u0440\u0443\u043f\u043f\u044b	54s	✓
J	\u0412\u044b\u0433\u043b\u044f\u043d\u0438 \u0432 \u043e\u043a\u043d\u043e	47s	✓
K	\u041a\u0430\u043f\u0438\u0431\u0430\u0440\u044b \u043d\u0430 \u0434\u0430\u0447\u043d\u043e\u043c \u0443\u0447\u0430\u0441\u0442\u043a\u0435	1m 4s	✓
L	\u0421\u0438\u043d\u0438\u0439 \u0422\u0440\u0430\u043a\u0442\u043e\u0440 Airlines	1m 7s	✓

Practice › Codeforces Solutions › Финал ВКОШП.Junior 2025 ›

CF 105828G - Время читать книги

We are given a fixed sequence of books, each with a reading time and a latest acceptable day by which it must be finished. The order of reading is not flexible: books are read in the given order from first to last.

Practice › Codeforces Solutions › Финал ВКОШП.Junior 2025 ›

CF 105828L - Синий Трактор Airlines

There are $n$ animals placed on distinct positions on an infinite number line. Each animal also has exactly one associated “fan” (we will call them collectors) placed on another set of distinct positions.

Practice › Codeforces Solutions › Финал ВКОШП.Junior 2025 ›

CF 105828J - Выгляни в окно

We are given several independent rectangles that represent possible shapes of a board. For each board, we need to count how many ways we can place an axis-aligned rectangular “window” inside it such that the window has a fixed area s, and it does not touch any border of…

Practice › Codeforces Solutions › Финал ВКОШП.Junior 2025 ›

CF 105828E - Простой карандаш

We are asked to count how many positive integers strictly smaller than a given number n could have appeared on a special pencil during sharpening. The key constraint is that all valid numbers must be prime and must not contain the digit zero.

Practice › Codeforces Solutions › Финал ВКОШП.Junior 2025 ›

CF 105828C - Цветы-мутанты

We are given a rectangular garden with $n$ rows and $m$ columns. Each cell contains an integer describing the type of flower growing there. We observe the garden twice: once before a transformation process and once after it.

Practice › Codeforces Solutions › Финал ВКОШП.Junior 2025 ›

CF 105828K - Капибары на дачном участке

We are given two sets of points on an infinite grid. The first set represents positions where cameras can be installed, and the second set represents positions of capybaras that must be observed.

Practice › Codeforces Solutions › Финал ВКОШП.Junior 2025 ›

CF 105828I - Учебные группы

We are given a set of $2n$ students and a list of pairs who cannot be placed in the same study group. The task is to split all students into two groups, each containing exactly $n$ people, so that no forbidden pair ends up inside a single group.

Practice › Codeforces Solutions › Финал ВКОШП.Junior 2025 ›

CF 105828H - Все на весенний бал!

We are given a set of distinct points on a 2D plane, each representing a nail on a wall. Any pair of nails can be connected with a straight string, forming a line segment.

Practice › Codeforces Solutions › Финал ВКОШП.Junior 2025 ›

CF 105828F - История о юноше, изучавшем математику, когда попал в другой мир

We are given several independent test cases. In each test case there is a set of cards, where each card has two digits written on it. One digit is visible when the card is placed normally, and the other digit appears after the card is flipped over.

Practice › Codeforces Solutions › Финал ВКОШП.Junior 2025 ›

CF 105828D - Опять секретики

We are given a collection of binary strings, all of the same length. Each string is a word in a language, and we are allowed to shorten a word only by deleting characters from its right end.

Practice › Codeforces Solutions › Финал ВКОШП.Junior 2025 ›

CF 105828B - Строки и столбцы

We are given an $n times n$ grid where every cell contains an integer from $1$ to $k-1$. Two different people extract a score from this same grid using two different aggregation rules.

Practice › Codeforces Solutions › Финал ВКОШП.Junior 2025 ›

CF 105828A - Бесконечная игра

We are given a row of cells, each containing a lowercase letter. A token starts at the first cell and repeatedly moves according to a deterministic rule.