Отбор на ВКОШП.Junior 18-02-23

12 problems from Отбор на ВКОШП.Junior 18-02-23 (contest 104199), difficulty -. 9/12 solutions verified against sample I/O.

12 items

Отбор на ВКОШП.Junior 18-02-23

Special | 12 problems | 9/12 verified | Difficulty - | 15m 54s

# Problem Rating Tags Accepted Time ✓
A \u041b\u0438\u0444\u0442 1m 5s ✓
B \u0420\u0430\u0441\u0441\u0442\u0430\u043d\u043e\u0432\u043a\u0430 \u043c\u0435\u0431\u0435\u043b\u0438 1m 26s ✓
C \u0411\u0435\u0437\u043b\u044e\u0434\u043d\u044b\u0439 \u043e\u0442\u0435\u043b\u044c 1m 24s ✓
D \u0414\u0435\u043c\u043e\u043d\u0442\u0430\u0436 1m 21s ✓
E \u041d\u0435 \u0432\u0441\u0435 \u0441\u043f\u0435\u0446\u0438\u0438 \u043e\u0434\u0438\u043d\u0430\u043a\u043e\u0432\u043e \u043f\u043e\u043b\u0435\u0437\u043d\u044b 1m 23s ✓
F \u041a\u043e\u043d\u0432\u0435\u0439\u0435\u0440\u043d\u044b\u0439 \u043e\u0442\u0435\u043b\u044c 1m 33s
G \u041f\u0440\u0438\u043a\u043b\u044e\u0447\u0435\u043d\u0438\u0435 \u043d\u0430 20 \u043c\u0438\u043d\u0443\u0442 1m 31s
H \u041d\u043e\u043c\u0435\u0440\u043a\u0438 1m 8s ✓
I \u0413\u0434\u0435 \u0436\u0435 \u043f\u0438\u0446\u0446\u0430?? 1m 15s ✓
J \u041a\u043e\u0448\u0430\u0447\u0438\u0439 \u0443\u0436\u0438\u043d 57s ✓
K \u0413\u043b\u044e\u0447\u043d\u044b\u0435 \u0440\u043e\u0431\u043e\u0430\u043d\u0442\u044b 1m 21s ✓
L \u0417\u0432\u0435\u0437\u0434\u0430 \u0432 \u041e\u0442\u0435\u043b\u0435 1m 30s
Practice › Codeforces Solutions › Отбор на ВКОШП.Junior 18-02-23 ›

CF 104199L - Звезда в Отеле

We are maintaining a dynamic line of guests in an event hall. Each guest has a unique numeric identifier. The line supports three types of operations that continuously reshape its order. A guest can arrive with a declared “friend reference” to another guest.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › Отбор на ВКОШП.Junior 18-02-23 ›

CF 104199K - Глючные робоанты

We are given an array that describes a starting arrangement of items on positions labeled from 1 to n. Position i initially holds item a[i], and the final goal is to transform this arrangement so that position i contains item i for every i.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › Отбор на ВКОШП.Junior 18-02-23 ›

CF 104199I - Где же пицца??

The grid describes a hotel sign made of uppercase letters, where a hidden construction encodes a 5-letter hotel name twice in a very specific geometric way.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › Отбор на ВКОШП.Junior 18-02-23 ›

CF 104199H - Номерки

We are given a key, which is an n-digit string, and we are asked to find all possible n-digit room numbers that are compatible with it under a set of digit-wise constraints.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › Отбор на ВКОШП.Junior 18-02-23 ›

CF 104199F - Конвейерный отель

We have $n$ friends standing in a line of rooms numbered from 1 to $n$. Each friend initially holds a package that must be delivered to exactly one other friend, and every friend is both a sender and a receiver.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › Отбор на ВКОШП.Junior 18-02-23 ›

CF 104199G - Приключение на 20 минут

We are given a linear corridor of doors arranged from left to right. Each door has a color, and every color appears exactly twice. The porter starts just to the left of the first door and wants to escape to the right of the last door.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › Отбор на ВКОШП.Junior 18-02-23 ›

CF 104199E - Не все специи одинаково полезны

There are $n$ different spices in a kitchen, each identified by a name. A daily dish is prepared by choosing exactly $m$ distinct spices, but we do not know which ones were chosen.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › Отбор на ВКОШП.Junior 18-02-23 ›

CF 104199J - Кошачий ужин

We are given a line of cats, each with a fixed “happiness contribution” if it eats from its personal bowl. There is also one shared bowl that any number of cats can use. If a cat uses its own bowl, it contributes its value, otherwise it contributes nothing.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › Отбор на ВКОШП.Junior 18-02-23 ›

CF 104199D - Демонтаж

We are given a row of buildings, each with a fixed height. You start from the ground outside the buildings, and your goal is to retrieve an item located on the roof of a specific building indexed by m.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › Отбор на ВКОШП.Junior 18-02-23 ›

CF 104199B - Расстановка мебели

We are given a hotel with several rooms, each room having a required number of chairs in an ideal plan. In reality, the hotel has a total of $N$ chairs that must be distributed across $K$ rooms.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › Отбор на ВКОШП.Junior 18-02-23 ›

CF 104199C - Безлюдный отель

We are given a word written as a sequence of lowercase Latin letters. A token starts on the first character and moves according to a deterministic rule that depends entirely on how many times the current character appears in the word.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › Отбор на ВКОШП.Junior 18-02-23 ›

CF 104199A - Лифт

We start at floor 0 and want to reach a target floor D. At every move, the elevator allows exactly two possible actions: go up by 3 floors or go down by 2 floors. Each action counts as one button press.
codeforces competitive-programming Jul 2, 2026