Codeforces Round 1050 (Div. 4)

7 problems from Codeforces Round 1050 (Div. 4) (contest 2148), difficulty 800-1900. 4/7 solutions verified against sample I/O.

7 items

Codeforces Round 1050 (Div. 4)

Div. 4 | 7 problems | 4/7 verified | Difficulty 800-1900 | 12m 21s

# Problem Rating Tags Accepted Time ✓
A Sublime Sequence 800 brute-force, hashing, math 47,386 1m 7s ✓
B Lasers 800 geometry 33,033 1m 11s ✓
C Pacer 900 greedy, math 25,326 1m 34s
D Destruction of the Dandelion Fields 1000 constructive-algorithms, greedy, sortings 26,723 1m 33s ✓
E Split 1200 binary-search, data-structures, two-pointers 14,039 1m 38s ✓
F Gravity Falls 1800 greedy, implementation, sortings 6,588 3m 20s
G Farmer John's Last Wish 1900 binary-search, data-structures, math 4,188 1m 58s
Practice › Codeforces Solutions › Codeforces Round 1050 (Div. 4) ›

CF 2148F - Gravity Falls

We are given several arrays of integers, each of potentially different lengths. We can think of these arrays as rows in a grid that we are allowed to stack in any order, left-aligned.
codeforces competitive-programming greedy implementation sortings Jun 8, 2026
Practice › Codeforces Solutions › Codeforces Round 1050 (Div. 4) ›

CF 2148G - Farmer John's Last Wish

We are given an array of integers representing objects lying on the floor. Farmer John is concerned with the greatest common divisor (GCD) of prefixes of this array.
codeforces competitive-programming binary-search data-structures math number-theory Jun 8, 2026
Practice › Codeforces Solutions › Codeforces Round 1050 (Div. 4) ›

CF 2148E - Split

We are given an array of positive integers and a parameter $k$. For any chosen segment $[l, r]$, we imagine splitting the array into two parts: inside the segment and outside the segment. Every element inside the segment is forced into a distinguished multiset, call it bucket 1.
codeforces competitive-programming binary-search data-structures two-pointers Jun 8, 2026
Practice › Codeforces Solutions › Codeforces Round 1050 (Div. 4) ›

CF 2148D - Destruction of the Dandelion Fields

We are given a sequence of fields, each containing some number of dandelions. We are allowed to choose the order in which we visit these fields, and each field is visited exactly once.
codeforces competitive-programming constructive-algorithms greedy sortings Jun 8, 2026
Practice › Codeforces Solutions › Codeforces Round 1050 (Div. 4) ›

CF 2148C - Pacer

We are simulating a very simple movement process along a line of time, where each minute Farmer John either stays on his current side of a gym or runs to the opposite side. Each time he chooses to run, he earns one point.
codeforces competitive-programming greedy math Jun 8, 2026
Practice › Codeforces Solutions › Codeforces Round 1050 (Div. 4) ›

CF 2148B - Lasers

We are working on a grid-like plane from the origin to a target point, but instead of being blocked by walls, the plane contains infinitely thin obstacles.
codeforces competitive-programming geometry Jun 8, 2026
Practice › Codeforces Solutions › Codeforces Round 1050 (Div. 4) ›

CF 2148A - Sublime Sequence

The problem gives us a number x and a length n and asks us to construct a sequence by alternating x and -x, starting with x. We are then asked to compute the sum of all elements in that sequence.
codeforces competitive-programming brute-force hashing math Jun 8, 2026