2021-2022 Olympiad Cognitive Technologies, Final Round

9 problems from 2021-2022 Olympiad Cognitive Technologies, Final Round (contest 103566), difficulty -. 7/9 solutions verified against sample I/O.

9 items

2021-2022 Olympiad Cognitive Technologies, Final Round

Special | 9 problems | 7/9 verified | Difficulty - | 6m 8s

#	Problem	Time	✓
A	\u0411\u0443\u043a\u0432\u044b \u043d\u0430 \u0437\u0430\u043a\u0430\u0437	48s	✓
B	\u0411\u0430\u0440\u0438\u0441\u0442\u0430	42s	✓
C	\u041f\u043e\u0441\u0443\u0434\u043e\u043c\u043e\u0439\u043a\u0430	44s	✓
D	Kingdoms and Alliances	30s
E	\u0421\u0442\u0438\u043a\u0435\u0440\u044b	41s	✓
F	\u041f\u0440\u044b\u0433\u0430\u0439 \u0432\u043f\u0435\u0440\u0435\u0434!	50s	✓
G	\u041f\u043e\u043b\u0438\u0432... <<\u041e\u0439!>>	34s
H	\u0414\u043e\u0440\u043e\u0433\u0430 \u0432 \u0448\u043a\u043e\u043b\u0443.	37s	✓
I	\u0411\u0430\u0448\u043d\u0438 \u0438\u0437 \u0441\u043f\u0438\u0447\u0435\u043a	42s	✓

Practice › Codeforces Solutions › 2021-2022 Olympiad Cognitive Technologies, Final Round ›

CF 103566F - Прыгай вперед!

We are given a sequence of cells numbered from 1 to n. From every cell there is exactly one deterministic jump to a cell with a larger index, so if you start from any position and repeatedly apply the jump rule, you always move strictly to the right and eventually reach cell n.

Practice › Codeforces Solutions › 2021-2022 Olympiad Cognitive Technologies, Final Round ›

CF 103566I - Башни из спичек

We are given a multiset of matchsticks, where each matchstick has an integer length. The same length can appear many times, and what matters is only how many times each length appears.

Practice › Codeforces Solutions › 2021-2022 Olympiad Cognitive Technologies, Final Round ›

CF 103566H - Дорога в школу.

We are given a path that can be thought of as a sequence of n road segments arranged in a line between a house and a school. Somewhere along this line there is a shortest valid route from the house to the school, and its length is an integer x.

Practice › Codeforces Solutions › 2021-2022 Olympiad Cognitive Technologies, Final Round ›

CF 103566C - Посудомойка

The process describes a system where plates appear in a sequence of operations, and each plate may be either used in future “requests of type 1” or never used at all.

Practice › Codeforces Solutions › 2021-2022 Olympiad Cognitive Technologies, Final Round ›

CF 103566G - Полив... <<Ой!>>

I can’t write a correct editorial yet because the actual problem statement for “Codeforces 103566G - Полив... <<Ой!” isn’t included in your prompt.

Practice › Codeforces Solutions › 2021-2022 Olympiad Cognitive Technologies, Final Round ›

CF 103566E - Стикеры

We are given a collection of N participants, each described by three pieces of information: a potential “friend reference” Fi, a readiness flag Pi, and a timestamp Ti.

Practice › Codeforces Solutions › 2021-2022 Olympiad Cognitive Technologies, Final Round ›

CF 103566D - Kingdoms and Alliances

I can’t write a correct editorial for “Codeforces 103566D - Kingdoms and Alliances” because the actual problem statement is missing from your prompt. Right now I only see placeholders for the statement, input, and output sections.

Practice › Codeforces Solutions › 2021-2022 Olympiad Cognitive Technologies, Final Round ›

CF 103566A - Буквы на заказ

The problem reduces language to a structural property of letters. Each lowercase English letter is classified only by how many “holes” it contains when drawn in a specific font used by the problem setter.

Practice › Codeforces Solutions › 2021-2022 Olympiad Cognitive Technologies, Final Round ›

CF 103566B - Бариста

We are given two integers, representing quantities $a$ and $b$, and we need to classify their ratio into one of three coffee types based on how large $a$ is compared to $b$. Instead of working with floating-point ratios, the decision is made using inequalities.