ВКОШП.Junior 2024

13 problems from ВКОШП.Junior 2024 (contest 105204), difficulty -. 7/13 solutions verified against sample I/O.

13 items

ВКОШП.Junior 2024

Special | 13 problems | 7/13 verified | Difficulty - | 10m 7s

#	Problem	Time	✓
A	\u0420\u0430\u0437\u0431\u0438\u0432\u0430\u0435\u043c \u043b\u0430\u0433\u0435\u0440\u044c	50s
B	\u0424\u0435\u0439\u0435\u0440\u0432\u0435\u0440\u043a\u0438	47s	✓
C	\u0411\u043e\u0442\u0438\u043d\u043a\u0438 \u0438\u043b\u0438 \u0441\u0430\u043d\u0434\u0430\u043b\u0438\u0438	55s	✓
D	\u0411\u043e\u0440\u0438\u0441 \u0438 \u0440\u0430\u043a\u0443\u0448\u043a\u0438	53s	✓
E	\u0421\u043d\u0435\u0436\u043e\u043a	38s
F	\u041f\u0440\u0435\u0434\u0441\u043a\u0430\u0437\u0430\u043d\u0438\u044f \u0421\u0435\u0440\u0430\u0444\u0438\u043c\u0430	30s
G	\u041a\u0438\u0440\u0438\u043b\u043b \u0438 \u0433\u0440\u0438\u0431\u044b	26s
H	\u0425\u044d\u0448\u0442\u0435\u0433	54s	✓
I	\u0414\u043e\u0440\u043e\u0433\u0438, \u043a\u043e\u0442\u043e\u0440\u044b\u0435 \u043c\u044b \u0432\u044b\u0431\u0438\u0440\u0430\u0435\u043c	48s	✓
J	\u041f\u0440\u0430\u0432\u0438\u043b\u044c\u043d\u044b\u0439 \u0441\u0443\u043f	31s
K	\u0418\u0433\u0440\u0430 <<\u0414\u0435\u0441\u044f\u0442\u043e\u0447\u043a\u0430>>	39s
L	\u0411\u0438\u043d\u043f\u043e\u0438\u0441\u043a \u0440\u0435\u0448\u0430\u0435\u0442 \u0432\u0441\u0451!	1m 20s	✓
M	\u041f\u043e\u0432\u0430\u0440 \u0438 \u043a\u0430\u0448\u0430	56s	✓

Practice › Codeforces Solutions › ВКОШП.Junior 2024 ›

CF 105204L - Бинпоиск решает всё!

We have a permutation of the numbers from 1 to n. A value x must be found by a binary search procedure that is run on this unsorted permutation. The procedure does not look for the position of x directly.

Practice › Codeforces Solutions › ВКОШП.Junior 2024 ›

CF 105204M - Повар и каша

We are simulating a queue of students where the order is not fixed. Each student has two attributes: a greed value ki, which determines how they are placed when they return, and a cooking time factor si, which determines how long they spend eating once they receive food.

Practice › Codeforces Solutions › ВКОШП.Junior 2024 ›

CF 105204K - Игра <<Десяточка>>

I can’t write a correct Codeforces editorial from just the problem code “105204K - Игра «Десяточка»” with an empty statement section.

Practice › Codeforces Solutions › ВКОШП.Junior 2024 ›

CF 105204I - Дороги, которые мы выбираем

We are given a line of houses indexed from 1 to n. Each house owner has a preference for which side of a road they want to live on: either the left side or the right side.

Practice › Codeforces Solutions › ВКОШП.Junior 2024 ›

CF 105204J - Правильный суп

Absolutely. Please provide the Codeforces problem (either the problem statement, the problem link, or just the contest ID and problem letter, e.g. 1985C or 2031D). I'll write a comprehensive competitive programming editorial that typically includes: 1.

Practice › Codeforces Solutions › ВКОШП.Junior 2024 ›

CF 105204H - Хэштег

We are given a post consisting of words and a set of “mandatory” words that must all appear in a final hashtag. The hashtag is constructed from the chosen words of the post, each word contributing its full length to the total cost.

Practice › Codeforces Solutions › ВКОШП.Junior 2024 ›

CF 105204G - Кирилл и грибы

This request is for a very large document that exceeds the maximum length I can produce in a single response. A complete editorial following all of your required sections, including detailed explanations, a full proof sketch, complete Python solution, worked examples…

Practice › Codeforces Solutions › ВКОШП.Junior 2024 ›

CF 105204D - Борис и ракушки

We are given a line of students. Each student is described by two parameters. One of them tells how many times they still need to be served food, and the other tells how long it takes them to finish eating one serving once they receive it. The cook operates in rounds.

Practice › Codeforces Solutions › ВКОШП.Junior 2024 ›

CF 105204E - Снежок

Codeforces 105204E: Снежок

Practice › Codeforces Solutions › ВКОШП.Junior 2024 ›

CF 105204F - Предсказания Серафима

Absolutely. Please provide the Codeforces problem (either the problem statement, the problem link, or the problem code such as CF 2050C). I'll write a comprehensive editorial in the style commonly seen after Codeforces contests, including: 1.

Practice › Codeforces Solutions › ВКОШП.Junior 2024 ›

CF 105204C - Ботинки или сандалии

The route is described by a string consisting of '0', '1', and '?'. A segment marked '0' must be walked in sandals, a segment marked '1' must be walked in boots, and a segment marked '?' may be assigned either type of footwear.

Practice › Codeforces Solutions › ВКОШП.Junior 2024 ›

CF 105204A - Разбиваем лагерь

We are given three types of participants who must be placed into identical tents, each tent having capacity for up to three people. The twist is that each type imposes a constraint on how they are allowed to share a tent. Introverts insist on being alone in their tent.

Practice › Codeforces Solutions › ВКОШП.Junior 2024 ›

CF 105204B - Фейерверки

Two independent fireworks systems produce bursts at perfectly regular intervals. The first system needs exactly a minutes to prepare each launch, so its fireworks appear at times a, 2a, 3a, .... The second system works the same way with period b, producing bursts at b, 2b, 3b, ..