Индивидуальная олимпиада школьников по информатике и программированию 2026
6 problems from Индивидуальная олимпиада школьников по информатике и программированию 2026 (contest 106473), difficulty -. 6/6 solutions verified against sample I/O.
Индивидуальная олимпиада школьников по информатике и программированию 2026
Special | 6 problems | 6/6 verified | Difficulty - | 5m 31s
CF 106473B - Добрый эксперимент
The hidden object is a balanced bracket string. We are allowed to ask whether some contiguous part of it is itself a valid bracket sequence, and we have enough questions to discover the whole string.
CF 106473F - Aibohphobia
We are given a string of lowercase letters. We may rearrange all of its characters and need to build a new string whose prefixes never become palindromes, except for the prefix of length one.
CF 106473E - Врата Вавилона
We are given a sequence of battles and a fixed-capacity hero. His strength is a number bounded above by a constant $H$, and it decreases whenever he fights. Between fights, he can freely use any number of magical artifacts.
CF 106473D - Нетрадиционная игра
We are given an array of integers, where each value is represented using a fixed number of bits. There is a special operation: we can choose any contiguous segment of the array and flip all bits of every number inside that segment.
CF 106473C - Потенциал Бибопа
We are given a string over lowercase Latin letters. The string is first compressed into maximal consecutive segments of identical characters, and the cost of the string is the sum of squares of the lengths of these segments.
CF 106473A - Экзамен на героя
We start with a system described by three numbers. There is a value on a display, initially a, and a current “power” value b. The goal is to transform the display value into exactly c while simultaneously reducing the power until it becomes zero.