Educational Codeforces Round 78 (Rated for Div. 2)

3 problems from Educational Codeforces Round 78 (Rated for Div. 2) (contest 1278), difficulty 1500-2200. 1/3 solutions verified against sample I/O.

3 items

Educational Codeforces Round 78 (Rated for Div. 2)

Div. 2 | 3 problems | 1/3 verified | Difficulty 1500-2200 | 14m 34s

#	Problem	Rating	Tags	Accepted	Time	✓
B	A and B	1500	greedy, math	14,177	1m 24s	✓
C	Berry Jam	1700	data-structures, dp, greedy	8,576	2m 33s
E	Tests for problem D	2200	constructive-algorithms, dfs-and-similar, divide-and-conquer	2,042	10m 37s

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

CF 1278E - Tests for problem D

We are given a tree with n labeled vertices. The task is not to manipulate the tree directly, but to construct a completely different object: n line segments on the number line, using the integers from 1 to 2n exactly once as endpoints.

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

CF 1278C - Berry Jam

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 78 (Rated for Div. 2) ›

CF 1278B - A and B

We are given two integers, and we are allowed to repeatedly perform operations where the cost of the k-th operation is exactly k. Each operation lets us choose one of the two numbers and add the current operation index to it.