Educational Codeforces Round 35 (Rated for Div. 2)

Solutions for Educational Codeforces Round 35 (Rated for Div. 2) (contest 911). 6/7 problems verified against sample I/O. Difficulty range: 1100-2500.

7 items

Educational Codeforces Round 35 (Rated for Div. 2)

Type: Div. 2 | Problems: 7 | Verified: 6/7 | Rating range: 1100-2500 | Time: 43m 22s

Problem Name Rating Tags Solve Time Verified
A Nearest Minimums 1100 implementation 3m 30s ✓
B Two Cakes 1200 binary-search, brute-force, implementation 4m 49s ✓
C Three Garlands 1400 brute-force, constructive-algorithms 5m 6s ✓
D Inversion Counting 1800 brute-force, math 4m 35s ✓
E Stack Sorting 2000 constructive-algorithms, data-structures, greedy 6m 3s ✓
F Tree Destruction 2400 constructive-algorithms, dfs-and-similar, graphs 14m 49s ✗
G Mass Change Queries 2500 data-structures 4m 30s ✓
Practice › Codeforces Solutions › Educational Codeforces Round 35 (Rated for Div. 2) ›

CF 911F - Tree Destruction

We are asked to process a tree with n vertices by performing n - 1 operations that each choose two leaves, add the distance between them to a running total, and remove one of the leaves.
codeforces competitive-programming constructive-algorithms dfs-and-similar graphs greedy trees Jun 13, 2026
Practice › Codeforces Solutions › Educational Codeforces Round 35 (Rated for Div. 2) ›

CF 911E - Stack Sorting

Problem Statement: You are given an array of integers $a1, a2, dots, an$ and an integer $k$. You can perform at most $k$ operations. In each operation, you can remove either the first or the last element of the array.
codeforces competitive-programming constructive-algorithms data-structures greedy implementation Jun 13, 2026
Practice › Codeforces Solutions › Educational Codeforces Round 35 (Rated for Div. 2) ›

CF 911G - Mass Change Queries

We are given a one-dimensional array of integers, and we must process a sequence of queries that selectively replace values in subarrays. Each query specifies a range within the array and two integers, x and y. For every element in that range equal to x, we replace it with y.
codeforces competitive-programming data-structures Jun 13, 2026
Practice › Codeforces Solutions › Educational Codeforces Round 35 (Rated for Div. 2) ›

CF 911C - Three Garlands

We are asked to decide whether three periodic garlands can be switched on so that at least one of them is always lit starting from the moment the last garland is switched on. Each garland has a fixed period, which means that once turned on, it lights every k-th second.
codeforces competitive-programming brute-force constructive-algorithms Jun 13, 2026
Practice › Codeforces Solutions › Educational Codeforces Round 35 (Rated for Div. 2) ›

CF 911B - Two Cakes

We are given two collections of indivisible cake pieces, one cake split into a pieces and another split into b pieces. We also have n plates, and we must distribute all pieces onto these plates.
codeforces competitive-programming binary-search brute-force implementation Jun 13, 2026
Practice › Codeforces Solutions › Educational Codeforces Round 35 (Rated for Div. 2) ›

CF 911D - Inversion Counting

We are given a permutation of integers from 1 to n, meaning every number in that range appears exactly once in some order. An inversion is a pair of positions where a larger index holds a smaller number than a smaller index, effectively a local "disorder.
codeforces competitive-programming brute-force math Jun 13, 2026
Practice › Codeforces Solutions › Educational Codeforces Round 35 (Rated for Div. 2) ›

CF 911A - Nearest Minimums

We are given an array of integers. Among all values in the array, there is a smallest value, and the problem guarantees that this minimum value appears at least twice. Our task is to find the smallest distance between any two occurrences of that minimum value.
codeforces competitive-programming implementation Jun 12, 2026