Educational Codeforces Round 186 (Rated for Div. 2)

8 problems from Educational Codeforces Round 186 (Rated for Div. 2) (contest 2182), difficulty 800-2800. 6/8 solutions verified against sample I/O.

8 items

Educational Codeforces Round 186 (Rated for Div. 2)

Div. 2 | 8 problems | 6/8 verified | Difficulty 800-2800 | 16m 15s

#	Problem	Rating	Tags	Accepted	Time	✓
A	New Year String	800	constructive-algorithms, greedy, implementation	25,310	1m 57s	✓
B	New Year Cake	800	brute-force	23,421	1m 30s	✓
C	Production of Snowmen	1200	brute-force, combinatorics, dp	15,499	1m 24s	✓
D	Christmas Tree Decoration	1600	combinatorics, dp, greedy	8,942	1m 55s
E	New Year's Gifts	1800	binary-search, data-structures, greedy	5,564	3m 28s	✓
F1	Christmas Reindeer (easy version)	2300	bitmasks, brute-force, combinatorics	1,269	1m 57s	✓
F2	Christmas Reindeer (hard version)	2500	bitmasks, brute-force, combinatorics	1,093	2m 17s	✓
G	Short Garland	2800	combinatorics, data-structures, dfs-and-similar	350	1m 47s

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

CF 2182G - Short Garland

We are given a rooted tree with vertex 1 fixed as the root. A sequence of n “placements” must be assigned, one for each vertex of the tree, but the twist is that the placement order is not arbitrary. The first placement is forced onto the root.

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

CF 2182F2 - Christmas Reindeer (hard version)

We have a dynamic herd of reindeer, each with strength $2^{ci}$, and we need to answer three types of queries: adding a reindeer, removing a reindeer, or counting how many subsets of the herd meet a certain carrying capacity threshold.

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

CF 2182E - New Year's Gifts

Monocarp wants to make as many friends happy as possible with a limited budget. He has a number of friends and a set of boxes.

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

CF 2182F1 - Christmas Reindeer (easy version)

We maintain a multiset of reindeer. Each reindeer is identified by a power level, but the real value that matters is a power of two, $2^{ci}$.

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

CF 2182D - Christmas Tree Decoration

We are given several independent scenarios. In each scenario, there are $n$ people and $n+1$ boxes of decorations. Box $0$ is special, and each person $i$ has their own personal box $i$. Each box starts with some number of decorations.

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

CF 2182A - New Year String

We are given a string composed of the characters 0, 2, 5, and 6. A string is considered a New Year string if it either contains the substring 2026 somewhere or does not contain the substring 2025 at all.

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

CF 2182B - New Year Cake

We are asked to help Monocarp bake a layered cake under two constraints: the size of each layer grows exponentially and the chocolate covering each layer must alternate between white and dark. The top layer always has size 1.

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

CF 2182C - Production of Snowmen

We are given three circular sequences of equal length, each representing sizes of snowballs on a conveyor belt. From each conveyor we choose a starting position, and then we simultaneously walk forward step by step around all three cycles.