Codeforces Round 956 (Div. 2) and ByteRace 2024

Solutions for Codeforces Round 956 (Div. 2) and ByteRace 2024 (contest 1983). 2/7 problems verified against sample I/O. Difficulty range: 800-3000.

7 items

Codeforces Round 956 (Div. 2) and ByteRace 2024

Type: Div. 2 | Problems: 7 | Verified: 2/7 | Rating range: 800-3000 | Time: 19m 26s

Problem Name Rating Tags Solve Time Verified
A Array Divisibility 800 constructive-algorithms, math 2m 1s ✗
B Corner Twist 1200 constructive-algorithms, greedy, implementation 6m 3s ✗
C Have Your Cake and Eat It Too 1400 binary-search, brute-force, greedy 2m 42s ✗
D Swap Dilemma 1700 constructive-algorithms, data-structures, divide-and-conquer 2m ✗
E I Love Balls 2300 combinatorics, math, probabilities 3m 20s ✓
F array-value 2500 binary-search, bitmasks, data-structures 1m 50s ✗
G Your Loss 3000 bitmasks, brute-force, dp 1m 30s ✓
Practice › Codeforces Solutions › Codeforces Round 956 (Div. 2) and ByteRace 2024 ›

CF 1983G - Your Loss

We are given a tree of n nodes where each node has an associated integer value. The problem asks us to process multiple queries where each query specifies two nodes, x and y.
codeforces competitive-programming bitmasks brute-force dp trees Jun 8, 2026
Practice › Codeforces Solutions › Codeforces Round 956 (Div. 2) and ByteRace 2024 ›

CF 1983B - Corner Twist

We are given two grids, a and b, each of size n by m. Every cell in the grids contains a value from 0 to 2. Our goal is to transform grid a into grid b using a specific operation any number of times.
codeforces competitive-programming constructive-algorithms greedy implementation math Jun 8, 2026
Practice › Codeforces Solutions › Codeforces Round 956 (Div. 2) and ByteRace 2024 ›

CF 1983E - I Love Balls

There are two kinds of balls. The first k balls are special, the remaining n-k are ordinary. Every ball has a value. The balls are removed one by one in a uniformly random order. The current player takes the chosen ball and adds its value to their score.
codeforces competitive-programming combinatorics math probabilities Jun 8, 2026
Practice › Codeforces Solutions › Codeforces Round 956 (Div. 2) and ByteRace 2024 ›

CF 1983F - array-value

We are given an array and we look at every possible contiguous subarray of length at least two. For each subarray, we compute a value defined as the smallest XOR among all pairs of indices inside that subarray.
codeforces competitive-programming binary-search bitmasks data-structures greedy two-pointers Jun 8, 2026
Practice › Codeforces Solutions › Codeforces Round 956 (Div. 2) and ByteRace 2024 ›

CF 1983D - Swap Dilemma

We are given two arrays of the same length, and each array is a permutation-like structure in the sense that all values inside each array are distinct.
codeforces competitive-programming constructive-algorithms data-structures divide-and-conquer greedy math sortings Jun 8, 2026
Practice › Codeforces Solutions › Codeforces Round 956 (Div. 2) and ByteRace 2024 ›

CF 1983C - Have Your Cake and Eat It Too

We are asked to split a linear cake of n pieces among Alice, Bob, and Charlie. Each person values each piece differently, and the total value of all pieces is the same for everyone.
codeforces competitive-programming binary-search brute-force greedy implementation Jun 8, 2026
Practice › Codeforces Solutions › Codeforces Round 956 (Div. 2) and ByteRace 2024 ›

CF 1983A - Array Divisibility

We are asked to construct an array of positive integers for each test case such that a family of divisibility conditions is satisfied simultaneously for every possible value of a parameter $k$ from 1 to $n$.
codeforces competitive-programming constructive-algorithms math Jun 8, 2026