Codeforces Round 1023 (Div. 2)

7 problems from Codeforces Round 1023 (Div. 2) (contest 2107), difficulty 800-2800. 1/7 solutions verified against sample I/O.

7 items

Codeforces Round 1023 (Div. 2)

Div. 2 | 7 problems | 1/7 verified | Difficulty 800-2800 | 11m 20s

# Problem Rating Tags Accepted Time ✓
A LRC and VIP 800 greedy, number-theory 22,200 1m 20s
B Apples in Boxes 1100 games, greedy, math 19,796 1m 38s ✓
C Maximum Subarray Sum 1500 binary-search, constructive-algorithms, dp 12,087 1m 39s
D Apple Tree Traversing 2100 brute-force, dfs-and-similar, greedy 3,553 1m 32s
E Ain and Apple Tree 2600 binary-search, constructive-algorithms, greedy 932 1m 33s
F1 Cycling (Easy Version) 2300 binary-search, brute-force, dp 1,821 1m 37s
F2 Cycling (Hard Version) 2800 binary-search, brute-force, data-structures 506 2m 1s
Practice › Codeforces Solutions › Codeforces Round 1023 (Div. 2) ›

CF 2107F2 - Cycling (Hard Version)

The problem presents a sequence of cyclists, each with an agility value. Leo is positioned at the back and wants to overtake all cyclists to reach the front.
codeforces competitive-programming binary-search brute-force data-structures dp greedy Jun 8, 2026
Practice › Codeforces Solutions › Codeforces Round 1023 (Div. 2) ›

CF 2107F1 - Cycling (Easy Version)

We are given a line of cyclists with different “agility costs” associated to each position. Leo starts behind the last cyclist and wants to move all the way to the front, passing every cyclist one by one until he is ahead of the first.
codeforces competitive-programming binary-search brute-force dp greedy Jun 8, 2026
Practice › Codeforces Solutions › Codeforces Round 1023 (Div. 2) ›

CF 2107E - Ain and Apple Tree

We are asked to construct a rooted tree on nodes labeled from 1 to n, where node 1 is fixed as the root. The contribution of a pair of nodes i and j is determined by how deep their lowest common ancestor is in this rooted tree.
codeforces competitive-programming binary-search constructive-algorithms greedy math trees Jun 8, 2026
Practice › Codeforces Solutions › Codeforces Round 1023 (Div. 2) ›

CF 2107D - Apple Tree Traversing

We are given a tree with n nodes, each node initially containing one apple. Our goal is to traverse this tree and repeatedly select paths consisting only of nodes that still have apples, remove the apples along that path, and write down three numbers: the length of the path…
codeforces competitive-programming brute-force dfs-and-similar greedy implementation trees Jun 8, 2026
Practice › Codeforces Solutions › Codeforces Round 1023 (Div. 2) ›

CF 2107C - Maximum Subarray Sum

We are given an array where some positions are already fixed and some positions are “unknown”. Unknown positions are initially set to zero, but we are allowed to overwrite them with arbitrary integers up to $10^{18}$.
codeforces competitive-programming binary-search constructive-algorithms dp implementation math Jun 8, 2026
Practice › Codeforces Solutions › Codeforces Round 1023 (Div. 2) ›

CF 2107B - Apples in Boxes

We are given several independent games. In each game, there are multiple boxes of apples. On every move, a player removes exactly one apple from a single non-empty box.
codeforces competitive-programming games greedy math Jun 8, 2026
Practice › Codeforces Solutions › Codeforces Round 1023 (Div. 2) ›

CF 2107A - LRC and VIP

We are given several independent arrays, and for each one we need to split its elements into two non-empty groups. Each number must go into exactly one group, so we are really choosing a binary labeling of indices.
codeforces competitive-programming greedy number-theory Jun 8, 2026