Educational Codeforces Round 54 (Rated for Div. 2)

7 problems from Educational Codeforces Round 54 (Rated for Div. 2) (contest 1076), difficulty 1200-3000. 6/7 solutions verified against sample I/O.

7 items

Educational Codeforces Round 54 (Rated for Div. 2)

Div. 2 | 7 problems | 6/7 verified | Difficulty 1200-3000 | 50m 17s

# Problem Rating Tags Accepted Time ✓
A Minimizing the String 1200 greedy, strings 14,100 1m 28s ✓
B Divisor Subtraction 1200 implementation, math, number-theory 14,583 1m 51s ✓
C Meme Problem 1300 binary-search, math 13,422 12m 41s ✓
D Edge Deletion 1800 graphs, greedy, shortest-paths 5,913 11m 46s ✓
E Vasya and a Tree 1900 data-structures, trees 4,150 4m 29s ✓
F Summer Practice Report 2500 dp, greedy 726 9m 51s ✓
G Array Game 3000 data-structures, games 722 8m 11s
Practice › Codeforces Solutions › Educational Codeforces Round 54 (Rated for Div. 2) ›

CF 1076G - Array Game

We are given a one-dimensional board where each cell contains a positive number of tokens. A chip starts on the left boundary of a chosen segment, and players alternate moves.
codeforces competitive-programming data-structures games Jun 15, 2026
Practice › Codeforces Solutions › Educational Codeforces Round 54 (Rated for Div. 2) ›

CF 1076C - Meme Problem

We are given a number $d$, and we want to decide whether we can split it into two non-negative real numbers $a$ and $b$ such that two conditions hold at the same time: their sum equals $d$, and their product also equals $d$.
codeforces competitive-programming binary-search math Jun 15, 2026
Practice › Codeforces Solutions › Educational Codeforces Round 54 (Rated for Div. 2) ›

CF 1076D - Edge Deletion

We are given a weighted undirected graph and we first imagine running a shortest path computation from vertex 1. This produces a distance value for every vertex, which we can think of as the true optimal cost of reaching that vertex in the original graph.
codeforces competitive-programming graphs greedy shortest-paths Jun 15, 2026
Practice › Codeforces Solutions › Educational Codeforces Round 54 (Rated for Div. 2) ›

CF 1076F - Summer Practice Report

We are given a sequence of pages, and each page contains a fixed number of two types of items: tables and formulas.
codeforces competitive-programming dp greedy Jun 15, 2026
Practice › Codeforces Solutions › Educational Codeforces Round 54 (Rated for Div. 2) ›

CF 1076E - Vasya and a Tree

We are given a rooted tree where vertex 1 acts as the root, and every vertex initially holds value 0. The tree is static, but we are asked to process a sequence of update operations.
codeforces competitive-programming data-structures trees Jun 15, 2026
Practice › Codeforces Solutions › Educational Codeforces Round 54 (Rated for Div. 2) ›

CF 1076B - Divisor Subtraction

We are given a single large integer and we repeatedly apply a deterministic process that always reduces it. At each step, we inspect the current number, find its smallest prime factor, subtract that factor from the number, and continue until the value becomes zero.
codeforces competitive-programming implementation math number-theory Jun 15, 2026
Practice › Codeforces Solutions › Educational Codeforces Round 54 (Rated for Div. 2) ›

CF 1076A - Minimizing the String

We are given a single string made of lowercase letters, and we are allowed to delete at most one character from it. After this optional deletion, we obtain a new string, and among all possible results (including doing nothing), we want the lexicographically smallest one.
codeforces competitive-programming greedy strings Jun 15, 2026