Educational Codeforces Round 59 (Rated for Div. 2)

Solutions for Educational Codeforces Round 59 (Rated for Div. 2) (contest 1107). 4/7 problems verified against sample I/O. Difficulty range: 900-2600.

7 items

Educational Codeforces Round 59 (Rated for Div. 2)

Type: Div. 2 | Problems: 7 | Verified: 4/7 | Rating range: 900-2600 | Time: 14m 22s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Digits Sequence Dividing	900	greedy, strings	1m 36s	✓
B	Digital root	1000	math, number-theory	1m 10s	✓
C	Brutality	1300	greedy, sortings, two-pointers	5m 27s	✗
D	Compression	1800	dp, implementation, math	1m 25s	✓
E	Vasya and Binary String	2400	dp	1m 38s	✗
F	Vasya and Endless Credits	2600	dp, flows, graph-matchings	1m 57s	✗
G	Vasya and Maximum Profit	2400	binary-search, constructive-algorithms, data-structures	1m 9s	✓

Practice › Codeforces Solutions › Educational Codeforces Round 59 (Rated for Div. 2) ›

CF 1107C - Brutality

We are given a fixed sequence of hits, where each hit has a damage value and is associated with a specific button (a lowercase letter). We are allowed to delete any hits from the sequence while keeping the remaining ones in their original order.

Practice › Codeforces Solutions › Educational Codeforces Round 59 (Rated for Div. 2) ›

CF 1107F - Vasya and Endless Credits

Vasya starts with zero burles and wants to buy a car. The bank offers n credit deals, each giving him an initial sum ai immediately and requiring monthly payments of bi for ki months. Vasya can take at most one credit per month, but multiple credits can overlap.

Practice › Codeforces Solutions › Educational Codeforces Round 59 (Rated for Div. 2) ›

CF 1107G - Vasya and Maximum Profit

Vasya wants to assemble a contest from a sequence of problems, each with a difficulty and a cost. He gains a fixed reward for including any problem, but he also pays two types of costs: the direct payment to each problem’s author and a “gap penalty” based on the largest…

Practice › Codeforces Solutions › Educational Codeforces Round 59 (Rated for Div. 2) ›

CF 1107E - Vasya and Binary String

We are given a binary string that we are allowed to repeatedly compress until nothing remains. A single move consists of picking a contiguous block of identical characters, either all 0s or all 1s, removing that block from the string, and concatenating the remaining parts.

Practice › Codeforces Solutions › Educational Codeforces Round 59 (Rated for Div. 2) ›

CF 1107D - Compression

We are given a square matrix of size $n times n$, but instead of being explicitly written as bits, each row is packed into hexadecimal characters. Each hex digit represents four binary cells, so the input is just a compact encoding of a binary matrix.

Practice › Codeforces Solutions › Educational Codeforces Round 59 (Rated for Div. 2) ›

CF 1107A - Digits Sequence Dividing

We are given a string of digits, each between 1 and 9. The task is to split this string into at least two consecutive segments so that when we interpret each segment as an integer, the resulting sequence is strictly increasing.

Practice › Codeforces Solutions › Educational Codeforces Round 59 (Rated for Div. 2) ›

CF 1107B - Digital root

We are asked to answer multiple independent queries. Each query gives two numbers, a position $k$ and a digit $x$ between 1 and 9. For each query, we need to output the $k$-th positive integer whose digital root equals $x$.