Codeforces Round 996 (Div. 2)

6 problems from Codeforces Round 996 (Div. 2) (contest 2055), difficulty 800-3200. 1/6 solutions verified against sample I/O.

6 items

Codeforces Round 996 (Div. 2)

Div. 2 | 6 problems | 1/6 verified | Difficulty 800-3200 | 10m 14s

# Problem Rating Tags Accepted Time ✓
A Two Frogs 800 constructive-algorithms, games, greedy 33,635 1m 26s ✓
B Crafting 1000 constructive-algorithms, greedy, sortings 27,277 1m 35s
C The Trail 1400 brute-force, constructive-algorithms, greedy 17,241 1m 44s
D Scarecrow 2000 greedy, implementation, math 4,366 1m 43s
E Haystacks 2800 brute-force, constructive-algorithms, data-structures 481 1m 58s
F Cosmic Divide 3200 brute-force, geometry, hashing 90 1m 48s
Practice › Codeforces Solutions › Codeforces Round 996 (Div. 2) ›

CF 2055E - Haystacks

We are given several piles of hay. Each pile starts with some number of haybales, and each pile also has a personal capacity that becomes relevant only after we empty it once.
codeforces competitive-programming brute-force constructive-algorithms data-structures greedy sortings Jun 8, 2026
Practice › Codeforces Solutions › Codeforces Round 996 (Div. 2) ›

CF 2055F - Cosmic Divide

We are given a polyomino described row by row. Each row contains a contiguous horizontal segment of filled unit cells, so the shape is a “staircase-like” union of intervals on integer rows.
codeforces competitive-programming brute-force geometry hashing math strings Jun 8, 2026
Practice › Codeforces Solutions › Codeforces Round 996 (Div. 2) ›

CF 2055D - Scarecrow

We are simulating a one-dimensional system where a crow moves only by teleportation, and its motion is entirely dictated by the nearest scarecrow on its left. The crow starts at position zero and wants to reach at least position ℓ.
codeforces competitive-programming greedy implementation math Jun 8, 2026
Practice › Codeforces Solutions › Codeforces Round 996 (Div. 2) ›

CF 2055C - The Trail

We are given a grid where every cell initially contains an integer altitude. Along one special path from the top-left corner to the bottom-right corner, all values have been erased and replaced with zero.
codeforces competitive-programming brute-force constructive-algorithms greedy math two-pointers Jun 8, 2026
Practice › Codeforces Solutions › Codeforces Round 996 (Div. 2) ›

CF 2055B - Crafting

We are given several test cases. In each one, we start with a collection of $n$ material types. Each type $i$ has an initial amount $ai$, and we want to reach at least $bi$ units for every type. There is a single operation that couples all resources tightly.
codeforces competitive-programming constructive-algorithms greedy sortings Jun 8, 2026
Practice › Codeforces Solutions › Codeforces Round 996 (Div. 2) ›

CF 2055A - Two Frogs

We are asked to analyze a two-player game played on a row of lilypads numbered from 1 to $n$. Alice starts on lilypad $a$ and Bob on lilypad $b$, and they take turns jumping either one step left or right. A frog loses if it cannot jump to a valid, unoccupied lilypad.
codeforces competitive-programming constructive-algorithms games greedy math Jun 8, 2026