Codeforces Round 822 (Div. 2)

6 problems from Codeforces Round 822 (Div. 2) (contest 1734), difficulty 800-2500. 2/6 solutions verified against sample I/O.

6 items

Codeforces Round 822 (Div. 2)

Div. 2 | 6 problems | 2/6 verified | Difficulty 800-2500 | 22m 1s

# Problem Rating Tags Accepted Time ✓
A Select Three Sticks 800 brute-force, greedy, sortings 22,406 2m 25s ✓
B Bright, Nice, Brilliant 800 constructive-algorithms 16,404 3m 18s
C Removing Smallest Multiples 1200 greedy, math 28,614 1m 56s ✓
D Slime Escape 1800 data-structures, dp, greedy 7,051 3m 39s
E Rectangular Congruence 2100 constructive-algorithms, number-theory 3,240 6m 30s
F Zeros and Ones 2500 bitmasks, divide-and-conquer, dp 974 4m 13s
Practice › Codeforces Solutions › Codeforces Round 822 (Div. 2) ›

CF 1734F - Zeros and Ones

The construction defines an infinite binary string where each stage doubles the previous string and flips the bits in the second half.
codeforces competitive-programming bitmasks divide-and-conquer dp math Jun 15, 2026
Practice › Codeforces Solutions › Codeforces Round 822 (Div. 2) ›

CF 1734E - Rectangular Congruence

We are asked to construct an $n times n$ matrix over the field of residues modulo a prime $n$. Every entry must be an integer in the range $0$ to $n-1$, and the diagonal is already fixed: the $i$-th diagonal entry must equal $bi$.
codeforces competitive-programming constructive-algorithms number-theory Jun 15, 2026
Practice › Codeforces Solutions › Codeforces Round 822 (Div. 2) ›

CF 1734D - Slime Escape

We start at position k on a line of n slimes. Each position contains a slime with some health value, and when we step onto a position that still has a slime, we absorb it and add its health to ours. Negative values reduce our health, positive values increase it.
codeforces competitive-programming data-structures dp greedy two-pointers Jun 15, 2026
Practice › Codeforces Solutions › Codeforces Round 822 (Div. 2) ›

CF 1734B - Bright, Nice, Brilliant

The structure is a triangular grid where row i contains i cells, and each cell can send influence downward to two children: directly below-left and below-right.
codeforces competitive-programming constructive-algorithms Jun 15, 2026
Practice › Codeforces Solutions › Codeforces Round 822 (Div. 2) ›

CF 1734A - Select Three Sticks

We are given a collection of sticks, each with a positive integer length. Our goal is to adjust the lengths using the minimum number of operations so that three of them can form an equilateral triangle.
codeforces competitive-programming brute-force greedy sortings Jun 9, 2026
Practice › Codeforces Solutions › Codeforces Round 822 (Div. 2) ›

CF 1734C - Removing Smallest Multiples

We are given the set of the first $n$ positive integers, $S = {1, 2, dots, n}$, and we want to remove some elements so that only the subset $T$ remains.
codeforces competitive-programming greedy math Jun 9, 2026