Educational Codeforces Round 77 (Rated for Div. 2)

5 problems from Educational Codeforces Round 77 (Rated for Div. 2) (contest 1260), difficulty 1000-2700. 3/5 solutions verified against sample I/O.

5 items

Educational Codeforces Round 77 (Rated for Div. 2)

Div. 2 | 5 problems | 3/5 verified | Difficulty 1000-2700 | 23m 18s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Heating	1000	math	15,814	2m 22s	✓
C	Infinite Fence	1700	greedy, math, number-theory	8,782	2m 47s
D	A Game with Traps	1900	binary-search, dp, greedy	4,189	10m 47s	✓
E	Tournament	2400	brute-force, dp, greedy	1,890	4m 54s
F	Colored Tree	2700	data-structures, trees	632	2m 28s	✓

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

CF 1260D - A Game with Traps

We are given a line of positions from 0 to n+1. A group of soldiers starts at position 0 together with the player character. Each soldier has a strength value, and traps placed along the line may kill soldiers whose strength is too low when they enter certain positions.

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

CF 1260E - Tournament

We are given a single-elimination tournament with $n$ participants, where $n$ is a power of two. Every participant has a distinct strength, so in any direct match the stronger boxer always wins unless we intervene.

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

CF 1260F - Colored Tree

We are given a tree where each vertex does not have a fixed color. Instead, every vertex has a range of possible colors, and we imagine choosing one integer color independently for each vertex within its allowed interval.

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

CF 1260C - Infinite Fence

There is not enough information to diagnose the bug or provide a corrected solution. The sample with expected output appears to belong to a string construction problem, but you have not provided: - the problem statement, - the original Python solution, - or even the name of…

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

CF 1260A - Heating

We are given a house with n rooms. For each room, we know two numbers: ci, the maximum number of radiators we can install, and sumi, the total number of radiator sections required to adequately heat that room.