Educational Codeforces Round 51 (Rated for Div. 2)

7 problems from Educational Codeforces Round 51 (Rated for Div. 2) (contest 1051), difficulty 1000-2900. 2/7 solutions verified against sample I/O.

7 items

Educational Codeforces Round 51 (Rated for Div. 2)

Div. 2 | 7 problems | 2/7 verified | Difficulty 1000-2900 | 45m 6s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Vasya And Password	1200	greedy, implementation, strings	8,886	5m 3s
B	Relatively Prime Pairs	1000	greedy, math, number-theory	18,808	6m 39s
C	Vasya and Multisets	1500	brute-force, dp, greedy	9,875	13m 40s
D	Bicolorings	1700	bitmasks, dp	8,158	8m 54s
E	Vasya and Big Integers	2600	binary-search, data-structures, dp	1,210	3m 4s	✓
F	The Shortest Statement	2400	graphs, shortest-paths, trees	3,751	4m 7s	✓
G	Distinctification	2900	data-structures, dsu, greedy	480	3m 39s

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

CF 1051G - Distinctification

We are given a growing sequence of points on the integer line. Each point has a position value and a weight. As we reveal more points one by one, we want to maintain a configuration where all positions are distinct, but we are allowed to move points left or right using very…

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

CF 1051D - Bicolorings

We are working with a very small geometric object: a grid with exactly two rows and $n$ columns. Each cell can independently be painted in one of two colors, which we can think of as black or white.

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

CF 1051F - The Shortest Statement

We are given a connected undirected weighted graph with up to one hundred thousand vertices and edges, but with a crucial structural restriction: the number of edges exceeds the number of vertices by at most twenty.

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

CF 1051C - Vasya and Multisets

We are given a sequence of numbers, but it behaves like a multiset, meaning duplicates matter and order only matters for output assignment. Each occurrence of a value must be assigned to one of two groups, A or B.

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

CF 1051E - Vasya and Big Integers

We are given one very long decimal string a, and we want to split it into a sequence of contiguous pieces. Each piece is a substring of a, taken in order, and the concatenation of all pieces must reproduce a exactly.

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

CF 1051B - Relatively Prime Pairs

We are given a contiguous segment of integers from $l$ to $r$, and the task is to partition all these numbers into pairs. Every number must appear in exactly one pair, so the segment is fully covered.

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

CF 1051A - Vasya And Password

We are given a password string consisting of digits and Latin letters in mixed case. The goal is to end up with a string that contains at least one lowercase letter, at least one uppercase letter, and at least one digit.