Educational Codeforces Round 131 (Rated for Div. 2)

Solutions for Educational Codeforces Round 131 (Rated for Div. 2) (contest 1701). 2/6 problems verified against sample I/O. Difficulty range: 800-2500.

6 items

Educational Codeforces Round 131 (Rated for Div. 2)

Type: Div. 2 | Problems: 6 | Verified: 2/6 | Rating range: 800-2500 | Time: 18m 49s

Problem Name Rating Tags Solve Time Verified
A Grass Field 800 implementation 2m 30s ✓
B Permutation 800 greedy 1m ✗
C Schedule Management 1400 binary-search, greedy, implementation 1m 42s ✓
D Permutation Restoration 1900 binary-search, data-structures, greedy 1m 2s ✗
E Text Editor 2500 brute-force, dp, greedy 2m 48s ✗
F Points 2500 combinatorics, data-structures, implementation 9m 47s ✗
Practice › Codeforces Solutions › Educational Codeforces Round 131 (Rated for Div. 2) ›

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

CF 1701F - Points

We are given a dynamic set of points on a number line and a fixed parameter $d$. A triple $(i,j,k)$ is called beautiful if the points satisfy $i < j < k$ and the distance between the endpoints $k - i$ is at most $d$. Initially the set of points is empty.
codeforces competitive-programming combinatorics data-structures implementation math matrices Jun 9, 2026
Practice › Codeforces Solutions › Educational Codeforces Round 131 (Rated for Div. 2) ›

CF 1701E - Text Editor

We are given two strings, s and t, representing the text we actually wrote and the text we want to have, respectively.
codeforces competitive-programming brute-force dp greedy strings Jun 9, 2026
Practice › Codeforces Solutions › Educational Codeforces Round 131 (Rated for Div. 2) ›

CF 1701A - Grass Field

We are given a tiny grass field of size $2 times 2$, where each cell either has grass (1) or is empty (0). The goal is to remove all grass using the fewest moves possible.
codeforces competitive-programming implementation Jun 9, 2026
Practice › Codeforces Solutions › Educational Codeforces Round 131 (Rated for Div. 2) ›

CF 1701C - Schedule Management

We are given a collection of tasks, where each task has a designated “preferred” worker. If a worker processes a task they are assigned to prefer, it takes one unit of time; otherwise it takes two.
codeforces competitive-programming binary-search greedy implementation two-pointers Jun 9, 2026
Practice › Codeforces Solutions › Educational Codeforces Round 131 (Rated for Div. 2) ›

CF 1701B - Permutation

Two constructions are proposed for generating a random variable $X$ with a nontrivial distribution on $[-1,1]$. The first maps a single uniform deviate through a trigonometric transformation.
codeforces competitive-programming greedy Jun 9, 2026