Educational Codeforces Round 187 (Rated for Div. 2)

6 problems from Educational Codeforces Round 187 (Rated for Div. 2) (contest 2203), difficulty 800-2600. 2/6 solutions verified against sample I/O.

6 items

Educational Codeforces Round 187 (Rated for Div. 2)

Div. 2 | 6 problems | 2/6 verified | Difficulty 800-2600 | 11m 26s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Towers of Boxes	800	math	17,942	1m 42s	✓
B	Beautiful Numbers	1000	bitmasks, dp, fft	14,238	2m 13s
C	Test Generator	1500	binary-search, bitmasks, greedy	6,996	2m 2s
D	Divisibility Game	1700	brute-force, games, greedy	5,416	1m 26s	✓
E	Probabilistic Card Game	2200	binary-search, data-structures, games	1,416	2m 1s
F	Binary Search with One Swap	2600	binary-search, divide-and-conquer, dp	414	2m 2s

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

CF 2203F - Binary Search with One Swap

We start with an array containing the numbers from 1 to n in increasing order. Then we pick two positions i and j and swap the elements at those positions, creating exactly one disturbance in an otherwise perfectly sorted sequence.

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

CF 2203E - Probabilistic Card Game

We are asked to compute the expected score for Bob in a turn-based card game where Alice and Bob play optimally. Each round, a new card is added to a deck.

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

CF 2203D - Divisibility Game

We are given two multisets, one called a and one called b. They define a game where players do not modify a at all, but gradually consume elements from b.

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

CF 2203B - Beautiful Numbers

We are asked to transform a given integer into a "beautiful number" with the minimum number of digit changes. A beautiful number is defined such that applying the sum-of-digits function twice yields the same result as applying it once.

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

CF 2203C - Test Generator

The problem asks us to generate an array of non-negative integers that sum up to a given total s, with the additional constraint that each element must only have bits set that are also set in another number m.

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

CF 2203A - Towers of Boxes

Monocarp has n identical boxes, each weighing m units and able to support up to d units on top. He wants to stack all the boxes into towers while respecting durability: no box can support more weight than d.