Educational Codeforces Round 82 (Rated for Div. 2)

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

6 items

Educational Codeforces Round 82 (Rated for Div. 2)

Div. 2 | 6 problems | 2/6 verified | Difficulty 800-2800 | 21m 13s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Erasing Zeroes	800	implementation, strings	36,691	1m 49s	✓
B	National Project	1400	math	16,802	3m 33s
C	Perfect Keyboard	1600	dfs-and-similar, greedy, implementation	12,857	2m 41s
D	Fill The Bag	1900	bitmasks, greedy	7,706	6m 48s	✓
F	Number of Components	2800	dsu, implementation	615	3m 15s
G	Sum of Prefix Sums	2700	data-structures, divide-and-conquer, geometry	1,008	3m 7s

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

CF 1303D - Fill The Bag

We are given a target amount of space, and a collection of available blocks whose sizes are powers of two. The task is to decide whether we can exactly compose the target size using these blocks, and if not, report impossibility.

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

CF 1303G - Sum of Prefix Sums

We are given a tree where each node stores a positive integer. For any simple path between two vertices, we read the values along that path in order and then compute a special score: we first form all prefix sums of that sequence and then sum those prefix sums together.

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

CF 1303F - Number of Components

We are working on a grid that starts completely empty in the sense that every cell contains the same value, zero. Over time, we perform a sequence of updates.

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

CF 1303B - National Project

We are building a road of length $n$, where each unit of road must eventually be asphalted exactly once. The construction proceeds day by day, and on each day we may either work on exactly one unit or do nothing. The weather is periodic.

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

CF 1303C - Perfect Keyboard

We are given a string consisting of lowercase letters, and we want to decide whether it is possible to arrange all 26 letters of the alphabet in a single line such that every consecutive pair of characters appearing in the string are also adjacent in this line layout.

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

CF 1303A - Erasing Zeroes

We are given a binary string, a sequence of 0's and 1's, and the goal is to manipulate it so that all the 1's appear in one contiguous block. The only allowed operation is to remove some 0's.