ICPC Central Russia Regional Contest (CRRC 20), Чемпионат Центральной России, квалификационный раунд
12 problems from ICPC Central Russia Regional Contest (CRRC 20), Чемпионат Центральной России, квалификационный раунд (contest 102775), difficulty -. 12/12 solutions verified against sample I/O.
ICPC Central Russia Regional Contest (CRRC 20), Чемпионат Центральной России, квалификационный раунд
ICPC/IOI | 12 problems | 12/12 verified | Difficulty - | 12m 3s
CF 102775K - Пятьпростое число
We need build an N-digit decimal number with a special sliding-window property. Every block of five consecutive digits inside the answer must itself be a prime number.
CF 102775C - Такие разные строки
We are given a single lowercase Latin string. A string is considered good if it never contains three consecutive vowels and never contains three consecutive consonants. If either of these situations appears anywhere in the string, the string is bad.
CF 102775A - Кто ближе?
The story can be reduced to a simple geometric decision on a number line. Three coordinates are given: the clown Nekit, the former owner Luka, and the dog. The dog must decide which person is closer. If the dog is closer to Nekit, the answer is Tetka.
CF 102775L - Вишневый вопрос
We have a collection of cherry trees. Each tree is described by three numbers: the day it begins blooming, the last day when new flowers are added, and how many flowers appear or disappear in one daily change.
CF 102775J - Пепелац
We are given a fixed sequence of button presses that must happen in order. Each press belongs to one of three buttons and requires the corresponding dial to show a particular value at the exact second when the press happens. All dials start at value 1.
CF 102775I - Переполох в НИИЧАВО
The task is to answer many independent queries about a mathematical function. For a value a, the function is the product $$f(a)=1^a cdot 2^{a-1}cdot 3^{a-2}cdots (a-1)^2cdot a^1$$ with the special value f(0)=1. Each query asks for this value modulo $10^9+7$.
CF 102775H - Пешка туда-сюда
We have an N by N board. Every cell belongs to one of three categories. A cell marked h turns the current piece into a knight, a cell marked p turns it into a special pawn that can move according to the problem’s movement rules, and a cell marked x cannot be entered at all.
CF 102775G - Математическое равенство
The task is to split a given natural number N into several positive integers. Every part of the split must have exactly the same sum of decimal digits. The number of parts must be at least two, cannot reach N itself, and cannot exceed one million.
CF 102775F - Эликсиры
The task describes a building upgrade that normally requires t minutes of work. An elixir is activated at the same moment as the upgrade starts. While the elixir is active for p minutes, the construction progresses k times faster than usual.
CF 102775E - Камень, ножницы, бумага...
The game has seven possible moves, and two players each choose one move. The first word in the input is the move of the cheerful controller, and the second word is the move of the sad controller.
CF 102775D - Различные элементы
The task is to look through a sequence of numbers and count how many different values satisfy a strict range condition. A value is included only when it is greater than x and smaller than y. If the same valid number appears several times, it contributes only once to the answer.
CF 102775B - Календари
The task is about comparing two calendar systems for the same moment in time. The input gives a valid date written according to the Gregorian calendar, with a day, month, and year. We need to determine how many days earlier the Julian calendar shows for that same date.