Educational Codeforces Round 36 (Rated for Div. 2)

Solutions for Educational Codeforces Round 36 (Rated for Div. 2) (contest 915). 4/7 problems verified against sample I/O. Difficulty range: 900-2400.

7 items

Educational Codeforces Round 36 (Rated for Div. 2)

Type: Div. 2 | Problems: 7 | Verified: 4/7 | Rating range: 900-2400 | Time: 57m 49s

Problem Name Rating Tags Solve Time Verified
A Garden 900 implementation 11m 44s ✓
B Browser 1300 implementation 5m 31s ✓
C Permute Digits 1700 dp, greedy 3m 31s ✓
D Almost Acyclic Graph 2200 dfs-and-similar, graphs 3m 24s ✓
E Physical Education Lessons 2300 data-structures, implementation, sortings 7m 46s ✗
F Imbalance Value of a Tree 2400 data-structures, dsu, graphs 14m 38s ✗
G Coprime Arrays 2300 math, number-theory 11m 15s ✗
Practice › Codeforces Solutions › Educational Codeforces Round 36 (Rated for Div. 2) ›

CF 915G - Coprime Arrays

We are asked to study arrays of fixed length where each element is chosen from a bounded range, and classify them by a global property: whether the entire array has greatest common divisor equal to one.
codeforces competitive-programming math number-theory Jun 13, 2026
Practice › Codeforces Solutions › Educational Codeforces Round 36 (Rated for Div. 2) ›

CF 915F - Imbalance Value of a Tree

We are given a tree with n vertices, where each vertex carries an integer label. For any pair of vertices x and y, we define the imbalance of the path connecting them as the difference between the maximum and minimum labels along that path.
codeforces competitive-programming data-structures dsu graphs trees Jun 13, 2026
Practice › Codeforces Solutions › Educational Codeforces Round 36 (Rated for Div. 2) ›

CF 915E - Physical Education Lessons

We are managing a line of days from 1 to n, where each day can be either working or non-working. Initially every day is working. Then a sequence of updates arrives, and after each update we must report how many working days currently exist.
codeforces competitive-programming data-structures implementation sortings Jun 13, 2026
Practice › Codeforces Solutions › Educational Codeforces Round 36 (Rated for Div. 2) ›

CF 915A - Garden

We are asked to water a linear garden of length k using one of n buckets. Each bucket waters a fixed segment of the garden every hour, specifically a continuous stretch of length ai. Luba must water the entire garden without leaving gaps and cannot water any part twice.
codeforces competitive-programming implementation Jun 13, 2026
Practice › Codeforces Solutions › Educational Codeforces Round 36 (Rated for Div. 2) ›

CF 915D - Almost Acyclic Graph

We are given a directed graph with n vertices and m edges. Each edge has a direction from some vertex u to another vertex v. The task is to determine whether we can remove at most one edge to make the graph acyclic.
codeforces competitive-programming dfs-and-similar graphs Jun 13, 2026
Practice › Codeforces Solutions › Educational Codeforces Round 36 (Rated for Div. 2) ›

CF 915B - Browser

We have a browser with n tabs numbered 1 through n. The mouse is currently at tab pos. Luba wants to end up with only the tabs in the segment [l, r] open. Every other tab needs to be closed, and the goal is to do it in the minimum number of seconds.
codeforces competitive-programming implementation Jun 13, 2026
Practice › Codeforces Solutions › Educational Codeforces Round 36 (Rated for Div. 2) ›

CF 915C - Permute Digits

We are given two integers, a and b. Our task is to rearrange the digits of a to produce the largest possible number that does not exceed b. The resulting number must use all digits of a exactly once and cannot have leading zeros.
codeforces competitive-programming dp greedy Jun 12, 2026