Educational Codeforces Round 43 (Rated for Div. 2)

3 problems from Educational Codeforces Round 43 (Rated for Div. 2) (contest 976), difficulty 800-2100. 2/3 solutions verified against sample I/O.

3 items

Educational Codeforces Round 43 (Rated for Div. 2)

Div. 2 | 3 problems | 2/3 verified | Difficulty 800-2100 | 4m 57s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Minimum Binary Number	800	implementation	10,974	1m 46s
C	Nested Segments	1500	greedy, implementation, sortings	10,625	1m 16s	✓
E	Well played!	2100	greedy, sortings	2,552	1m 55s	✓

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

CF 976E - Well played!

Each creature starts with a fixed health value and a fixed damage value. We are allowed to improve the army using two global operations. One operation increases a creature’s health by doubling it, and the other operation overwrites a creature’s damage with its current health.

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

CF 976A - Minimum Binary Number

We are given a binary string that is already in a valid canonical form, meaning it represents a non-negative integer in binary without unnecessary leading zeros.

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

CF 976C - Nested Segments

We are given a collection of closed intervals on a number line. Each interval represents a segment with a left endpoint and a right endpoint, and we need to determine whether there exists a pair of distinct segments such that one is fully contained inside the other.