Codeforces Round 982 (Div. 2)

Solutions for Codeforces Round 982 (Div. 2) (contest 2027). 1/7 problems verified against sample I/O. Difficulty range: 800-3100.

7 items

Codeforces Round 982 (Div. 2)

Type: Div. 2 | Problems: 7 | Verified: 1/7 | Rating range: 800-3100 | Time: 27m 27s

Problem Name Rating Tags Solve Time Verified
A Rectangle Arrangement 800 geometry, implementation, math 3m 9s ✓
B Stalin Sort 1100 brute-force, greedy 4m 57s ✗
C Add Zeros 1500 brute-force, data-structures, dfs-and-similar 5m 7s ✗
D1 The Endspeaker (Easy Version) 1700 binary-search, dp, graphs 5m 56s ✗
D2 The Endspeaker (Hard Version) 2200 binary-search, data-structures, dp 5m 10s ✗
E1 Bit Game (Easy Version) 2800 bitmasks, brute-force, games 1m 17s ✗
E2 Bit Game (Hard Version) 3100 bitmasks, dp, math 1m 51s ✗
Practice › Codeforces Solutions › Codeforces Round 982 (Div. 2) ›

CF 2027D2 - The Endspeaker (Hard Version)

We are working with two sequences that interact through a kind of “resource budgeting” process. The first sequence, a, represents a list of tasks we must completely remove by repeatedly cutting off prefixes.
codeforces competitive-programming binary-search data-structures dp greedy implementation two-pointers Jun 9, 2026
Practice › Codeforces Solutions › Codeforces Round 982 (Div. 2) ›

CF 2027B - Stalin Sort

We are asked to determine how many elements must be removed from an array to make it vulnerable. A vulnerable array is one that can be made non-increasing by repeatedly applying Stalin Sort on any of its subarrays.
codeforces competitive-programming brute-force greedy Jun 9, 2026
Practice › Codeforces Solutions › Codeforces Round 982 (Div. 2) ›

CF 2027D1 - The Endspeaker (Easy Version)

We have an array a that must be removed completely. At any moment we are at some index k in array b, starting from k = 1. For the current value b[k], we may repeatedly remove a non-empty prefix of the remaining array whose sum is at most b[k]. Every such removal costs m - k.
codeforces competitive-programming binary-search dp graphs greedy implementation two-pointers Jun 9, 2026
Practice › Codeforces Solutions › Codeforces Round 982 (Div. 2) ›

CF 2027C - Add Zeros

We are given an array of integers, and we can perform a specific operation repeatedly to extend its length. The operation allows us to choose a position i in the array (not the first element) such that the value at that position equals the array’s current size minus i plus one.
codeforces competitive-programming brute-force data-structures dfs-and-similar dp graphs greedy Jun 9, 2026
Practice › Codeforces Solutions › Codeforces Round 982 (Div. 2) ›

CF 2027E2 - Bit Game (Hard Version)

We are asked to analyze a multi-pile turn-based game between Alice and Bob. Each pile has a fixed maximum move size, denoted $ai$, and a maximum number of stones, $bi$.
codeforces competitive-programming bitmasks dp math Jun 8, 2026
Practice › Codeforces Solutions › Codeforces Round 982 (Div. 2) ›

CF 2027E1 - Bit Game (Easy Version)

Each test case gives us several independent piles of stones. Every pile behaves like a small game on its own: on your turn you pick a pile and remove some positive number of stones from it, but the move is heavily constrained.
codeforces competitive-programming bitmasks brute-force games math Jun 8, 2026
Practice › Codeforces Solutions › Codeforces Round 982 (Div. 2) ›

CF 2027A - Rectangle Arrangement

We are given several axis-aligned rectangles, each with fixed integer width and height. Every rectangle must be placed somewhere on an infinite grid, and when placed it paints exactly the cells inside that rectangle black.
codeforces competitive-programming geometry implementation math Jun 8, 2026