Educational Codeforces Round 89 (Rated for Div. 2)

5 problems from Educational Codeforces Round 89 (Rated for Div. 2) (contest 1366), difficulty 1300-2700. 4/5 solutions verified against sample I/O.

5 items

Educational Codeforces Round 89 (Rated for Div. 2)

Div. 2 | 5 problems | 4/5 verified | Difficulty 1300-2700 | 23m 28s

# Problem Rating Tags Accepted Time ✓
B Shuffle 1300 math, two-pointers 27,934 1m 50s ✓
C Palindromic Paths 1500 greedy, math 14,260 2m 10s ✓
D Two Divisors 2000 constructive-algorithms, math, number-theory 12,341 5m 59s
E Two Arrays 2100 binary-search, brute-force, combinatorics 4,623 10m 41s ✓
G Construct the String 2700 data-structures, dp, strings 619 2m 48s ✓
Practice › Codeforces Solutions › Educational Codeforces Round 89 (Rated for Div. 2) ›

CF 1366D - Two Divisors

Each input value can be viewed as a box labeled with an integer, and for every box we must choose two non-trivial divisors of that number.
codeforces competitive-programming constructive-algorithms math number-theory Jun 16, 2026
Practice › Codeforces Solutions › Educational Codeforces Round 89 (Rated for Div. 2) ›

CF 1366E - Two Arrays

We are given two arrays, a and b. Array b is strictly increasing, and our task is to partition array a into exactly m consecutive subarrays, where each subarray's minimum matches the corresponding element in b.
codeforces competitive-programming binary-search brute-force combinatorics constructive-algorithms dp two-pointers Jun 11, 2026
Practice › Codeforces Solutions › Educational Codeforces Round 89 (Rated for Div. 2) ›

CF 1366G - Construct the String

We are given a string s consisting of lowercase letters and dots. If we process this string from left to right, every letter is pushed onto a stack and every dot removes the current top character. The function f(s) returns the final stack contents as a string.
codeforces competitive-programming data-structures dp strings Jun 11, 2026
Practice › Codeforces Solutions › Educational Codeforces Round 89 (Rated for Div. 2) ›

CF 1366C - Palindromic Paths

We have a binary matrix. A path starts at the top-left cell and ends at the bottom-right cell, moving only right or down. Every path visits exactly one cell from each "distance layer" measured from the start.
codeforces competitive-programming greedy math Jun 11, 2026
Practice › Codeforces Solutions › Educational Codeforces Round 89 (Rated for Div. 2) ›

CF 1366B - Shuffle

We are given an array of size $n$ initialized with all zeros except for a single one at position $x$. The array is 1-indexed. We then have $m$ operations, each defined by a range $[li, ri]$. In each operation, we can swap any two elements within that range.
codeforces competitive-programming math two-pointers Jun 11, 2026