vkoshp.letovo 2022

13 problems from vkoshp.letovo 2022 (contest 105002), difficulty -. 6/13 solutions verified against sample I/O.

13 items

vkoshp.letovo 2022

Special | 13 problems | 6/13 verified | Difficulty - | 15m 50s

#	Problem	Time	✓
A	\u0420\u044f\u0434 \u0438\u0437 \u043a\u0443\u0431\u0438\u043a\u043e\u0432	1m 7s	✓
B	\u0421\u0435\u043c\u044c \u0447\u0443\u0434\u0435\u0441	1m 14s	✓
C	\u0418\u0433\u0440\u0430 \u0432 \u0434\u043e\u043c\u0438\u043d\u043e	1m 19s
D	\u041a\u0440\u0430\u0441\u043d\u043e-\u0441\u0438\u043d\u0438\u0435 \u0444\u0438\u0448\u043a\u0438	1m 17s	✓
E	\u041c\u0435\u0433\u0430\u041f\u043e\u043a\u0435\u0440	1m 6s	✓
F	\u0417\u0430\u043c\u0435\u043d\u0438 \u043d\u0430 \u0441\u0443\u043c\u043c\u0443	1m 5s	✓
G	\u0411\u0430\u043b\u0434\u0430	1m 3s	✓
H	Table Football	1m 9s
I	\u041f\u0440\u0438\u0434\u0443\u043c\u0430\u0439 \u0437\u0430\u0434\u0430\u043d\u0438\u0435	1m 45s
J	\u0421\u043a\u043e\u043b\u044c\u043a\u043e \u0440\u0430\u0437\u043b\u0438\u0447\u043d\u044b\u0445	1m 22s
K	\u041f\u0438\u0440\u0430\u0442\u0441\u043a\u0438\u0435 \u0441\u0443\u043d\u0434\u0443\u043a\u0438	1m 43s
L	\u041c\u043e\u043d\u0441\u0442\u0440\u044b	23s
M	\u041d\u043e\u0434\u043d\u044b\u0435 \u043e\u0431\u043c\u0435\u043d\u044b	1m 17s

Practice › Codeforces Solutions › vkoshp.letovo 2022 ›

CF 105002M - Нодные обмены

We are given a row of $n$ numbers. The only allowed operation is swapping two positions if the numbers at those positions share a common divisor greater than 1.

Practice › Codeforces Solutions › vkoshp.letovo 2022 ›

CF 105002K - Пиратские сундуки

We are given a sequence of chests arranged in a line, each chest carrying a value that can be positive or negative. A player starts before the first chest and has a limited number of tokens.

Practice › Codeforces Solutions › vkoshp.letovo 2022 ›

CF 105002J - Сколько различных

We are given a multiset of cards, where each card has a number written on it. From these cards, we consider every possible subset of cards. For each subset, we compute how many distinct values appear inside it, then we sum this quantity over all subsets.

Practice › Codeforces Solutions › vkoshp.letovo 2022 ›

CF 105002L - Монстры

We are given a collection of monsters, and we want to choose some of them to maximize how many we take, under a global limit on total “aggressiveness”. Each monster behaves in a slightly conditional way.

Practice › Codeforces Solutions › vkoshp.letovo 2022 ›

CF 105002I - Придумай задание

Each test case gives a word, and for that word we need to decide whether it can be seen as an “expanded” version of some shorter string after inserting exactly one character.

Practice › Codeforces Solutions › vkoshp.letovo 2022 ›

CF 105002H - Table Football

We are given a string made of lowercase Latin letters. Two players alternate turns. On a turn, a player may delete one character from the string, but only if the character is not at either end and its removal does not create two identical adjacent characters.

Practice › Codeforces Solutions › vkoshp.letovo 2022 ›

CF 105002G - Балда

We are given a grid of size n by m, where each cell contains either a letter or a dot indicating an empty cell. On this grid, we want to determine whether a given word s already appears as a valid “snake” path.

Practice › Codeforces Solutions › vkoshp.letovo 2022 ›

CF 105002D - Красно-синие фишки

We are working with a 3×3 sliding board where the middle cell is special. Initially, that center cell is empty, and the other eight cells contain chips colored either red or blue.

Practice › Codeforces Solutions › vkoshp.letovo 2022 ›

CF 105002F - Замени на сумму

Two sequences of numbers are given, and the allowed operation is to repeatedly compress any adjacent pair inside either sequence by replacing it with their sum. Each compression reduces the length of that sequence by one, while preserving the total sum of its elements.

Practice › Codeforces Solutions › vkoshp.letovo 2022 ›

CF 105002E - МегаПокер

We are given a sequence of cards arranged in a fixed order. Each card carries an integer value between 1 and m. We are allowed to delete any subset of cards, but we cannot reorder the remaining ones.

Practice › Codeforces Solutions › vkoshp.letovo 2022 ›

CF 105002C - Игра в домино

We are given a valid chain of domino tiles, already placed in order. Each tile has two numbers from 0 to 6. Adjacent tiles in the chain already match on touching ends, so the chain is consistent.

Practice › Codeforces Solutions › vkoshp.letovo 2022 ›

CF 105002B - Семь чудес

We are given three piles of science cards, each pile corresponding to a different symbol. One pile counts cards of type R, another S, and another T.

Practice › Codeforces Solutions › vkoshp.letovo 2022 ›

CF 105002A - Ряд из кубиков

We are given a sequence of identical standard dice placed in a straight line on a table. Each die has the usual six faces, and opposite faces always sum to 7. The dice are aligned left to right, touching each other side-by-side, and the table hides the bottom faces of all dice.