Educational Codeforces Round 183 (Rated for Div. 2)

7 problems from Educational Codeforces Round 183 (Rated for Div. 2) (contest 2145), difficulty 800-2900. 2/7 solutions verified against sample I/O.

7 items

Educational Codeforces Round 183 (Rated for Div. 2)

Div. 2 | 7 problems | 2/7 verified | Difficulty 800-2900 | 12m 44s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Candies for Nephews	800	math	30,736	1m 19s	✓
B	Deck of Cards	1000	greedy, implementation	21,532	1m 42s
C	Monocarp's String	1300	binary-search, greedy, strings	15,391	1m 48s
D	Inversion Value of a Permutation	1800	constructive-algorithms, dfs-and-similar, dp	6,658	1m 36s
E	Predicting Popularity	2100	binary-search, data-structures, greedy	3,065	3m 12s	✓
F	Long Journey	2500	dfs-and-similar, divide-and-conquer, dp	981	1m 43s
G	Cost of Coloring	2900	combinatorics, divide-and-conquer, dp	523	1m 24s

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

CF 2145E - Predicting Popularity

We are tasked with predicting how many users on a streaming platform will watch a movie, given each user's preference for action and drama, and the movie's action and drama levels. Each user has thresholds for action and drama.

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

CF 2145G - Cost of Coloring

We are given a rectangular sheet with $n$ rows and $m$ columns, initially uncolored. Our task is to determine how many ways we can color it “beautifully” with exactly $k$ colors, using the fewest operations possible for each number of operations from $min(n, m)$ to $n+m-1$.

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

CF 2145F - Long Journey

We are given a very long one-dimensional strip of cells, numbered from 0 up to m. A chip starts at cell 0 and wants to reach cell m in as few turns as possible. Each turn, the chip either stays where it is or moves one step to the right.

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

CF 2145D - Inversion Value of a Permutation

We are asked to construct a permutation of length $n$, meaning we must arrange the numbers from $1$ to $n$ exactly once in some order. For any fixed permutation, we can look at its inversions, which are pairs of positions where a larger number appears before a smaller one.

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

CF 2145C - Monocarp's String

We are given a binary string consisting only of a and b. From this string, we are allowed to remove exactly one contiguous block of characters, possibly empty. After this deletion, we look at the remaining characters and count how many a and b are left.

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

CF 2145B - Deck of Cards

We are given a deck of cards numbered from 1 to n, initially sorted with 1 on top and n on the bottom. Monocarp performs a sequence of k operations that remove cards from either the top, the bottom, or ambiguously from either end.

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

CF 2145A - Candies for Nephews

Monocarp wants to divide a certain number of candies evenly among his three nephews. He starts with n candies and needs to figure out how many more, if any, he must buy to make the total divisible by three.