Codeforces Round 983 (Div. 2)

Solutions for Codeforces Round 983 (Div. 2) (contest 2032). 1/6 problems verified against sample I/O. Difficulty range: 800-2700.

6 items

Codeforces Round 983 (Div. 2)

Type: Div. 2 | Problems: 6 | Verified: 1/6 | Rating range: 800-2700 | Time: 11m 29s

Problem Name Rating Tags Solve Time Verified
A Circuit 800 greedy, implementation, math 1m 45s ✓
B Medians 1100 constructive-algorithms, greedy, implementation 1m 38s ✗
C Trinity 1400 binary-search, math, sortings 2m 24s ✗
D Genokraken 1800 constructive-algorithms, data-structures, graphs 1m 51s ✗
E Balanced 2400 constructive-algorithms, data-structures, greedy 1m 52s ✗
F Peanuts 2700 combinatorics, dp, games 1m 59s ✗
Practice › Codeforces Solutions › Codeforces Round 983 (Div. 2) ›

CF 2032F - Peanuts

We are given a sequence of pockets, each containing a positive number of peanuts. Alice can partition the sequence into contiguous boxes of pockets.
codeforces competitive-programming combinatorics dp games math Jun 8, 2026
Practice › Codeforces Solutions › Codeforces Round 983 (Div. 2) ›

CF 2032E - Balanced

We are given a circular array of odd length $n$, where each element is an integer. We can perform an operation on any index $i$ which increases the element at $i$ by 2 and its immediate neighbors by 1. The goal is to transform the array so that all elements are equal.
codeforces competitive-programming constructive-algorithms data-structures greedy implementation math Jun 8, 2026
Practice › Codeforces Solutions › Codeforces Round 983 (Div. 2) ›

CF 2032D - Genokraken

We are tasked with reconstructing the parent array of a tree rooted at node 0, under a very specific structure. Each node is numbered from 0 to n-1, and for each node i ≥ 1, we want to find its parent node pi. The twist is that we do not see the tree directly.
codeforces competitive-programming constructive-algorithms data-structures graphs greedy implementation interactive trees two-pointers Jun 8, 2026
Practice › Codeforces Solutions › Codeforces Round 983 (Div. 2) ›

CF 2032C - Trinity

We are given an array of integers representing potential triangle sides, and the allowed operation is to copy one element over another. The ultimate goal is to make every distinct triplet of elements form a non-degenerate triangle.
codeforces competitive-programming binary-search math sortings two-pointers Jun 8, 2026
Practice › Codeforces Solutions › Codeforces Round 983 (Div. 2) ›

CF 2032A - Circuit

The problem describes a circuit with $n$ lights and $2n$ switches. Each light is connected to exactly two switches, and each switch is connected to exactly one light.
codeforces competitive-programming greedy implementation math number-theory Jun 8, 2026
Practice › Codeforces Solutions › Codeforces Round 983 (Div. 2) ›

CF 2032B - Medians

We start with an array that is simply the numbers from 1 to n in increasing order, where n is guaranteed to be odd. We are allowed to cut this array into several contiguous pieces. Every piece must also have odd length, and the number of pieces itself must be odd.
codeforces competitive-programming constructive-algorithms greedy implementation math Jun 8, 2026