Educational Codeforces Round 48 (Rated for Div. 2)

7 problems from Educational Codeforces Round 48 (Rated for Div. 2) (contest 1016), difficulty 900-2700. 3/7 solutions verified against sample I/O.

7 items

Educational Codeforces Round 48 (Rated for Div. 2)

Div. 2 | 7 problems | 3/7 verified | Difficulty 900-2700 | 17m 27s

# Problem Rating Tags Accepted Time ✓
A Death Note 900 greedy, implementation, math 15,969 1m 24s ✓
B Segment Occurrences 1300 brute-force, implementation 10,149 1m 56s ✓
C Vasya And The Mushrooms 1800 dp, implementation 3,991 2m 8s
D Vasya And The Matrix 1800 constructive-algorithms, flows, math 4,985 4m 3s
E Rest In The Shades 2400 binary-search, geometry 1,295 2m 26s ✓
F Road Projects 2600 dfs-and-similar, dp, trees 1,028 2m 18s
G Appropriate Team 2700 bitmasks, math, number-theory 315 3m 12s
Practice › Codeforces Solutions › Educational Codeforces Round 48 (Rated for Div. 2) ›

CF 1016G - Appropriate Team

We are given a list of candidate values, and we want to count how many ordered pairs of candidates can simultaneously support a hidden integer value $v$ under two arithmetic constraints involving gcd and lcm with fixed constants $X$ and $Y$.
codeforces competitive-programming bitmasks math number-theory Jun 16, 2026
Practice › Codeforces Solutions › Educational Codeforces Round 48 (Rated for Div. 2) ›

CF 1016D - Vasya And The Matrix

We are asked to construct a grid of size n by m where each cell contains a non-negative integer. What we know in advance is not the grid itself, but two sets of constraints derived from it: the XOR of every row is fixed, and the XOR of every column is fixed.
codeforces competitive-programming constructive-algorithms flows math Jun 16, 2026
Practice › Codeforces Solutions › Educational Codeforces Round 48 (Rated for Div. 2) ›

CF 1016F - Road Projects

We are given a weighted tree whose nodes are cities and whose edges are existing roads with travel times. The structure guarantees a unique simple path between any two cities, so distances are well-defined tree distances.
codeforces competitive-programming dfs-and-similar dp trees Jun 16, 2026
Practice › Codeforces Solutions › Educational Codeforces Round 48 (Rated for Div. 2) ›

CF 1016E - Rest In The Shades

The task revolves around a point light source moving horizontally at a fixed negative height, and a set of disjoint segments lying on the x-axis that act as obstacles.
codeforces competitive-programming binary-search geometry Jun 16, 2026
Practice › Codeforces Solutions › Educational Codeforces Round 48 (Rated for Div. 2) ›

CF 1016C - Vasya And The Mushrooms

We are given a grid with two rows and $n$ columns. Each cell contains a value that represents how many mushrooms grow per minute in that cell. Vasya starts at the top-left cell and must move every minute to a neighboring cell sharing an edge.
codeforces competitive-programming dp implementation Jun 16, 2026
Practice › Codeforces Solutions › Educational Codeforces Round 48 (Rated for Div. 2) ›

CF 1016B - Segment Occurrences

We are given a base string $s$ and a pattern string $t$, both made of lowercase letters. The task is to answer many independent queries, where each query asks: inside a given substring of $s$, how many times does $t$ appear as a contiguous substring?
codeforces competitive-programming brute-force implementation Jun 16, 2026
Practice › Codeforces Solutions › Educational Codeforces Round 48 (Rated for Div. 2) ›

CF 1016A - Death Note

We are simulating how writing progresses through an infinite notebook where each page can store a fixed number of names.
codeforces competitive-programming greedy implementation math Jun 16, 2026