Educational Codeforces Round 53 (Rated for Div. 2)

7 problems from Educational Codeforces Round 53 (Rated for Div. 2) (contest 1073), difficulty 1000-2600. 6/7 solutions verified against sample I/O.

7 items

Educational Codeforces Round 53 (Rated for Div. 2)

Div. 2 | 7 problems | 6/7 verified | Difficulty 1000-2600 | 32m 32s

# Problem Rating Tags Accepted Time ✓
A Diverse Substring 1000 implementation, strings 17,051 4m 49s ✓
B Vasya and Books 1000 implementation, math 11,219 4m 39s ✓
C Vasya and Robot 1800 binary-search, two-pointers 5,435 4m 25s ✓
D Berland Fair 1700 binary-search, brute-force, data-structures 6,722 4m 27s ✓
E Segment Sum 2300 bitmasks, combinatorics, dp 3,571 3m 54s ✓
F Choosing Two Paths 2500 dfs-and-similar, dp, greedy 593 5m 52s
G Yet Another LCP Problem 2600 data-structures, string-suffix-structures 1,112 4m 26s ✓
Practice › Codeforces Solutions › Educational Codeforces Round 53 (Rated for Div. 2) ›

CF 1073F - Choosing Two Paths

We are given a tree, meaning a connected graph with no cycles. On this tree we must pick two simple paths, each defined by choosing two endpoints. The endpoints of the two paths must all be distinct, and neither path is allowed to contain either endpoint of the other path.
codeforces competitive-programming dfs-and-similar dp greedy trees Jun 15, 2026
Practice › Codeforces Solutions › Educational Codeforces Round 53 (Rated for Div. 2) ›

CF 1073G - Yet Another LCP Problem

We are given a fixed string, and each query asks us to compare two groups of suffixes of this string. Every element in the query is a starting position in the string, so each position represents the suffix beginning there.
codeforces competitive-programming data-structures string-suffix-structures Jun 15, 2026
Practice › Codeforces Solutions › Educational Codeforces Round 53 (Rated for Div. 2) ›

CF 1073A - Diverse Substring

We are given a single string consisting of lowercase letters, and we are asked to find any contiguous segment of this string such that no single character dominates that segment by appearing more than half of its length. If such a segment exists, we may output any one of them.
codeforces competitive-programming implementation strings Jun 15, 2026
Practice › Codeforces Solutions › Educational Codeforces Round 53 (Rated for Div. 2) ›

CF 1073B - Vasya and Books

We are given a stack of books where each book has a unique label. The stack order matters: the first array describes which book is at the top, and the last element is at the bottom.
codeforces competitive-programming implementation math Jun 15, 2026
Practice › Codeforces Solutions › Educational Codeforces Round 53 (Rated for Div. 2) ›

CF 1073D - Berland Fair

We are simulating a cyclic walk over an array of booth prices. Polycarp starts at position 1 and keeps moving clockwise in a fixed cycle. At each booth, he checks whether his remaining money is at least the price of one candy at that booth.
codeforces competitive-programming binary-search brute-force data-structures greedy Jun 15, 2026
Practice › Codeforces Solutions › Educational Codeforces Round 53 (Rated for Div. 2) ›

CF 1073E - Segment Sum

We are asked to consider every integer inside a range $[l, r]$ and filter it by a digit constraint: we only keep numbers that use at most $k$ distinct decimal digits in their usual base-10 representation.
codeforces competitive-programming bitmasks combinatorics dp math Jun 15, 2026
Practice › Codeforces Solutions › Educational Codeforces Round 53 (Rated for Div. 2) ›

CF 1073C - Vasya and Robot

We are given a fixed sequence of moves for a robot on an infinite grid, starting from the origin. Each character in the sequence moves the robot one step in one of the four cardinal directions.
codeforces competitive-programming binary-search two-pointers Jun 15, 2026