Codeforces Round 1022 (Div. 2)

6 problems from Codeforces Round 1022 (Div. 2) (contest 2108), difficulty 800-2900. 1/6 solutions verified against sample I/O.

6 items

Codeforces Round 1022 (Div. 2)

Div. 2 | 6 problems | 1/6 verified | Difficulty 800-2900 | 9m 21s

# Problem Rating Tags Accepted Time ✓
A Permutation Warm-Up 800 combinatorics, greedy, math 22,148 1m 9s ✓
B SUMdamental Decomposition 1300 bitmasks, constructive-algorithms, greedy 14,541 1m 37s
C Neo's Escape 1500 binary-search, brute-force, data-structures 14,681 1m 33s
D Needle in a Numstack 2200 binary-search, brute-force, implementation 2,418 1m 37s
E Spruce Dispute 2600 constructive-algorithms, dfs-and-similar, graphs 888 1m 42s
F Fallen Towers 2900 binary-search, greedy 547 1m 43s
Practice › Codeforces Solutions › Codeforces Round 1022 (Div. 2) ›

CF 2108F - Fallen Towers

We are given an array of towers, each tower starting with some non-negative height. We must process every tower exactly once, in any order we choose.
codeforces competitive-programming binary-search greedy Jun 8, 2026
Practice › Codeforces Solutions › Codeforces Round 1022 (Div. 2) ›

CF 2108E - Spruce Dispute

We are given a tree with an odd number of vertices. Almost all vertices carry ornaments, and every ornament belongs to exactly one color, with each color appearing on exactly two vertices. One vertex is special and initially uncolored, acting as a “topper”.
codeforces competitive-programming constructive-algorithms dfs-and-similar graphs greedy implementation shortest-paths trees Jun 8, 2026
Practice › Codeforces Solutions › Codeforces Round 1022 (Div. 2) ›

CF 2108D - Needle in a Numstack

We are given a hidden array C formed by concatenating two unknown arrays A and B. The split point is unknown. Both arrays are over the alphabet {1, 2, ...
codeforces competitive-programming binary-search brute-force implementation interactive Jun 8, 2026
Practice › Codeforces Solutions › Codeforces Round 1022 (Div. 2) ›

CF 2108B - SUMdamental Decomposition

We are asked to construct an array of n positive integers whose bitwise XOR is exactly x and to minimize the sum of the array. Instead of outputting the array itself, we are asked to return the sum of the elements.
codeforces competitive-programming bitmasks constructive-algorithms greedy implementation math Jun 8, 2026
Practice › Codeforces Solutions › Codeforces Round 1022 (Div. 2) ›

CF 2108C - Neo's Escape

Neo is faced with a row of buttons, each labeled with a positive integer weight. He wants to press all the buttons such that the sequence of weights of the pressed buttons never increases.
codeforces competitive-programming binary-search brute-force data-structures dp dsu graphs greedy implementation Jun 8, 2026
Practice › Codeforces Solutions › Codeforces Round 1022 (Div. 2) ›

CF 2108A - Permutation Warm-Up

We are given a permutation of the numbers from 1 to n, and we measure how far each element moves away from its original position. For each position i, we take the absolute difference between the value sitting there and i itself, and sum this over the entire array.
codeforces competitive-programming combinatorics greedy math Jun 8, 2026