Цикл Интернет-олимпиад, Сезон 2020-21, Вторая командная олимпиада
10 problems from Цикл Интернет-олимпиад, Сезон 2020-21, Вторая командная олимпиада (contest 102793), difficulty -. 5/10 solutions verified against sample I/O.
Цикл Интернет-олимпиад, Сезон 2020-21, Вторая командная олимпиада
Special | 10 problems | 5/10 verified | Difficulty - | 9m 20s
CF 102793B - Результаты контеста
I need the problem details to write a correct editorial. Please provide the missing statement/input/output information. Waiting for your answer
CF 102793C - Собака, предатель и кабеля
The board is a rectangular grid of cells. Some borders between neighboring cells contain cable segments. When the dog moves from one cell to an adjacent cell, it cuts the cable on the border it crosses, if that border exists.
CF 102793J - Супер-счастливые билетики
A ticket is a string of n digits, where n is even. We need count how many such strings satisfy two balance conditions. The first condition says the sum of digits in the left half equals the sum in the right half.
CF 102793I - Теория Рамсея
We have an undirected graph where rooms are vertices and tunnels are edges. We need to find a small group of rooms with one of two properties. The first possibility is a clique of size l, meaning every pair of rooms in the group has a tunnel between them.
CF 102793H - Similar Names
I can write the editorial, but I’m missing the actual problem details for Codeforces 102793H - Similar Names. The statement section in your prompt is empty, and I couldn’t reliably identify the problem from the ID alone.
CF 102793G - Место преступления
I need the full problem statement details to write a correct editorial, especially the input format and the exact optimization goal. Please provide the missing statement or link text. Waiting for your answer
CF 102793F - Электронный замок
We have a row of n panels. Every panel starts turned off. A successful code is a configuration where exactly the given k positions are on and every other position is off.
CF 102793E - Настройка коммуникаций
I can write the editorial, but I do not have enough information to do it correctly. The problem statement section in your prompt is empty, and I could not reliably recover the full statement for Codeforces 102793E “Настройка коммуникаций” from the…
CF 102793D - Домино
A domino in this problem is represented by a row of dots with one vertical separator. The dots on the left and right sides of the separator are the numbers of points on the two halves of the tile. We are given two such tiles and need to decide whether they can be placed together.
CF 102793A - Смена стиля
The task is to convert variable names written in one of the common programming styles, camelCase or CamelCase, into snakecase. A variable name is a single string of Latin letters where word boundaries are marked by capital letters.