ICPC Central Russia Regional Contest (CRRC 19), Чемпионат Центральной России, квалификационный раунд
11 problems from ICPC Central Russia Regional Contest (CRRC 19), Чемпионат Центральной России, квалификационный раунд (contest 102777), difficulty -. 11/11 solutions verified against sample I/O.
ICPC Central Russia Regional Contest (CRRC 19), Чемпионат Центральной России, квалификационный раунд
ICPC/IOI | 11 problems | 11/11 verified | Difficulty - | 18m 46s
CF 102777C - Цветная доска
The board has N rows and M columns. Its cells are colored with seven colors that repeat cyclically along diagonals. After Alice names a cell (X, Y), we must determine the color number assigned to that cell.
CF 102777B - Палиндром Морзе
We need to decide whether a lowercase English string becomes a palindrome after replacing every character with its Morse representation and joining all those representations together.
CF 102777G - Товарищ майор
The input describes a network of criminals. Each criminal is a vertex of an undirected graph, and each documented connection is an edge between two vertices. A criminal community is a connected group of criminals, but a single isolated criminal does not count as a community.
CF 102777H - Последовательность Аслана
We need find the value of a sequence at a very large position. The first two elements are fixed, and every next element is created from the previous two elements plus a value that depends on the current index.
CF 102777K - Свести к нулю
The task asks us to find the minimum number of moves needed to turn a positive integer into zero. A move can either reduce the current value by one, or replace it with a smaller factor obtained by splitting the number into two factors and keeping the larger one.
CF 102777J - Цветная игровая доска
We have an N × M rectangular board. The chip starts in the upper left cell and moves along a spiral path that covers the board. After exactly k moves, we need to determine the color of the cell where the chip stops. The board itself is not given because it is too large.
CF 102777I - Как тебе такое, Илон Маск?
The HyperLoop network can be viewed as a directed graph with n stations. From every station there are exactly two outgoing edges: a left tunnel and a right tunnel.
CF 102777F - Prime Game
The input is a prime number written as a decimal string. We are allowed to erase any digits from it while keeping the relative order of the remaining digits. The goal is to leave a number that is both prime and appears in a fixed list of candidate primes.
CF 102777E - Калькулятор Электроника-2020
The calculator display is a three-row text drawing where every character occupies a fixed 3 by 3 area. The screen contains digits, plus or minus signs, and a final equality sign. Adjacent symbols are separated by one blank column.
CF 102777D - Сериалы
We need choose the earliest starting moment for watching a series. The only given information is the duration of the episode in minutes.
CF 102777A - Максимальный делитель
The input is a positive integer written as a binary string. The task is to find the largest exponent b such that the represented number can be divided by 2^b without a remainder. In binary, dividing by a power of two has a very direct meaning.