Educational Codeforces Round 164 (Rated for Div. 2)

Solutions for Educational Codeforces Round 164 (Rated for Div. 2) (contest 1954). 2/6 problems verified against sample I/O. Difficulty range: 900-3100.

6 items

Educational Codeforces Round 164 (Rated for Div. 2)

Type: Div. 2 | Problems: 6 | Verified: 2/6 | Rating range: 900-3100 | Time: 7m 33s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Painting the Ribbon	900	constructive-algorithms, greedy, math	1m 3s	✓
B	Make It Ugly	1200	implementation, math	1m 15s	✗
C	Long Multiplication	1200	greedy, math, number-theory	1m 13s	✗
D	Colored Balls	1800	combinatorics, dp, math	1m 43s	✗
E	Chain Reaction	2200	binary-search, data-structures, dsu	1m 12s	✗
F	Unique Strings	3100	combinatorics, dp, math	1m 7s	✓

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

CF 1954A - Painting the Ribbon

We are asked to decide whether Alice can paint a ribbon of n parts using m colors such that Bob, who can repaint at most k parts into the same color, cannot make the entire ribbon monochromatic.

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

CF 1954B - Make It Ugly

We are given an array of integers that is guaranteed to be "beautiful," which means that through a specific operation, all elements can eventually become the same.

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

CF 1954C - Long Multiplication

We are given two very large integers represented as strings, both having the same number of digits. Every digit is between 1 and 9, so there are no zeros to complicate positional effects or leading zero issues.

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

CF 1954D - Colored Balls

We are given a collection of balls, each assigned one of n distinct colors, where color i has ai balls. We are allowed to group these balls, but each group can have at most two balls, and no two balls in the same group can have the same color.

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

CF 1954E - Chain Reaction

We are given a line of monsters, each with some initial health. One operation consists of choosing a single monster as the starting point of a “chain lightning”.

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

CF 1954F - Unique Strings

We are given a binary string of length $n$ where the first $c$ characters are ones and the remaining $n - c$ characters are zeros. We are allowed to perform up to $k$ operations, where each operation flips a zero into a one.