Цикл Интернет-олимпиад, Сезон 2020-21, Третья командная олимпиада
10 problems from Цикл Интернет-олимпиад, Сезон 2020-21, Третья командная олимпиада (contest 102836), difficulty -. 5/10 solutions verified against sample I/O.
Цикл Интернет-олимпиад, Сезон 2020-21, Третья командная олимпиада
Special | 10 problems | 5/10 verified | Difficulty - | 6m 44s
CF 102836B - Переливание жижи
We have three tanks with fixed capacities. Each tank currently contains some amount of liquid, and we want to reach a final situation where the three amounts match the required values, but the required values may belong to different tanks because the tank order does not matter.
CF 102836A - Торговый центр
I can write the editorial, but the problem statement for Codeforces 102836A - “Торговый центр” is missing from your prompt.
CF 102836J - Выходной
I can write the full editorial, but I’m missing the actual problem content. Codeforces Gym problem 102836J - Выходной is not available from the information provided here, and the statement fields in your prompt are empty.
CF 102836I - Ксероксинатор
The problem describes a post office that operates for n minutes. At the start of minute i, a[i] clones enter the queue. During that minute, the post office serves at most b clones from the front of the queue. Served clones leave at the end of the same minute.
CF 102836H - Большой батут
We are given up to nine support points on a plane. We must decide whether these points can be arranged as the vertices of a simple polygon, meaning the border of the polygon cannot cross itself and cannot touch itself at a non-adjacent point.
CF 102836G - Большое задание
I can write the full editorial, but the problem statement section in your prompt is empty, so I do not have enough information to know what Codeforces 102836G (“Большое задание”) actually asks.
CF 102836F - Минимальная строка
The task is about a string made of lowercase English letters. We are allowed to erase characters from it, but the number of erased positions cannot exceed the given limit.
CF 102836E - Японский кроссворд
I need the actual problem details to write a correct editorial and solution. Please provide the statement or input/output constraints for this problem. Waiting for your answer
CF 102836D - Игра в Мафию
The game has k players and lasts for m nights. During every night, the currently alive players have some meetings with each other. At the end of the night exactly one alive player is killed by the mafia.