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

11 problems from Отбор на ВКОШП.Junior 2025 (contest 105826), difficulty -. 6/11 solutions verified against sample I/O.

11 items

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

Special | 11 problems | 6/11 verified | Difficulty - | 8m 19s

#	Problem	Time	✓
A	A + B	54s	✓
B	\u0417\u0430\u043a\u0440\u0430\u0441\u043a\u0430 \u0442\u043e\u0447\u0435\u043a	35s	✓
C	\u041a\u043e\u0444\u0435\u0439\u043d\u044b\u0435 \u043a\u043e\u043b\u0435\u0447\u043a\u0438	52s	✓
D	\u0411\u0435\u043d\u0435\u0434\u0438\u043a\u0442 \u0438 \u044f\u0431\u043b\u043e\u043a\u0438	19s
E	\u0417\u0430\u0433\u0430\u0434\u0430\u0439 \u0436\u0435\u043b\u0430\u043d\u0438\u0435	1m 10s	✓
F	\u041b\u044f\u0433\u0443\u0448\u043a\u0430 \u0438 \u0441\u0442\u0440\u043e\u043a\u0430	29s	✓
G	\u041c\u043e\u0437\u0430\u0438\u043a\u0430	27s
H	\u0411\u0438\u0442\u0435\u043d\u0433\u0438 \u043d\u0430 \u043f\u0440\u0438\u0447\u0430\u043b\u0435	19s
I	\u0414\u0435\u043b\u0438\u043c \u043f\u0435\u0447\u0435\u043d\u044c\u043a\u0438	23s
J	\u041e \u0448\u043e\u043a\u043e\u0440\u0435\u0437\u0430\u0445 \u0438 \u0448\u043e\u043a\u043e\u043b\u0430\u0434\u0435	56s	✓
K	\u0421\u0443\u043c\u043c\u044b \u0438 \u043f\u0440\u043e\u0438\u0437\u0432\u0435\u0434\u0435\u043d\u0438\u044f	1m 55s

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

CF 105826K - Суммы и произведения

Sure. Please provide the Codeforces problem statement (or a link/name/contest ID), and I’ll write a detailed editorial in a competitive programming style.

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

CF 105826J - О шокорезах и шоколаде

The cuts form a closed axis-aligned polyline. Every segment is either horizontal or vertical, each segment starts where the previous one ended, and the last segment returns to the starting point. These cut lines divide the infinite chocolate plane into several connected regions.

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

CF 105826E - Загадай желание

We are given a collection of people, each associated with a name. We are allowed to rearrange them in a circle, but the arrangement is not arbitrary: we are interested in a very specific local condition that determines whether a person is “happy” or can “make a wish”.

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

CF 105826I - Делим печеньки

Sure. Please provide the Codeforces problem statement (or link/name), constraints, and any example tests if available.

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

CF 105826H - Битенги на причале

I can write a full editorial only if I have the actual problem statement (or at least the input/output specification).

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

CF 105826F - Лягушка и строка

The problem describes a frog moving along a string. Every position contains one character, and characters belong to one of three categories: lowercase letters, uppercase letters, or digits. The frog starts at the first position and wants to reach the last one.

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

CF 105826G - Мозаика

The problem statement for Codeforces 105826G - “Мозаика” is missing from your message, so I don’t have enough information to write a correct editorial.

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

CF 105826A - A + B

The task describes a minimal arithmetic transformation on a pair of integers. You are given two values that represent whole numbers, and the goal is to compute their combined value and output it directly.

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

CF 105826D - Бенедикт и яблоки

I can write the editorial, but I need the actual problem statement or at least the input/output details for Codeforces 105826D “Бенедикт и яблоки”.

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

CF 105826C - Кофейные колечки

We are simulating what happens inside a coffee cup over time. The cup starts empty, and then we process a sequence of operations that either pour some amount of coffee into the cup or drink some amount out of it. The important detail is that coffee is conceptually layered.

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

CF 105826B - Закраска точек

We have a regular polygon with n numbered vertices. Starting from the first vertex, we repeatedly move by a fixed step k around the polygon and draw the segments between the visited vertices. Every vertex reached by this process becomes painted.