Codeforces Round 926 (Div. 2)

Solutions for Codeforces Round 926 (Div. 2) (contest 1929). 3/6 problems verified against sample I/O. Difficulty range: 800-2300.

6 items

Codeforces Round 926 (Div. 2)

Type: Div. 2 | Problems: 6 | Verified: 3/6 | Rating range: 800-2300 | Time: 11m 38s

Problem Name Rating Tags Solve Time Verified
A Sasha and the Beautiful Array 800 constructive-algorithms, greedy, math 1m 40s ✓
B Sasha and the Drawing 800 constructive-algorithms, greedy, math 2m 7s ✓
C Sasha and the Casino 1400 binary-search, brute-force, constructive-algorithms 2m 33s ✗
D Sasha and a Walk in the City 1900 combinatorics, dp, math 2m 24s ✗
E Sasha and the Happy Tree Cutting 2300 bitmasks, brute-force, dfs-and-similar 1m 13s ✓
F Sasha and the Wedding Binary Search Tree 2300 brute-force, combinatorics, data-structures 1m 41s ✗
Practice › Codeforces Solutions › Codeforces Round 926 (Div. 2) ›

CF 1929F - Sasha and the Wedding Binary Search Tree

We are asked to count how many ways we can assign integer values to the vertices of a rooted binary tree such that it forms a valid binary search tree, with all values constrained between $1$ and $C$.
codeforces competitive-programming brute-force combinatorics data-structures dfs-and-similar math trees Jun 9, 2026
Practice › Codeforces Solutions › Codeforces Round 926 (Div. 2) ›

CF 1929E - Sasha and the Happy Tree Cutting

We are given a tree with n vertices and a set of k pairs of vertices. Sasha wants to ensure that for each pair (ai, bi), there is at least one colored edge on the simple path connecting ai and bi.
codeforces competitive-programming bitmasks brute-force dfs-and-similar dp graphs greedy math trees Jun 9, 2026
Practice › Codeforces Solutions › Codeforces Round 926 (Div. 2) ›

CF 1929C - Sasha and the Casino

Sasha plays a repeated betting game where each bet either multiplies his stake by a factor or loses it entirely. The only control he has is the size of each bet, and he is allowed to adapt it based on past outcomes.
codeforces competitive-programming binary-search brute-force constructive-algorithms games greedy math Jun 9, 2026
Practice › Codeforces Solutions › Codeforces Round 926 (Div. 2) ›

CF 1929D - Sasha and a Walk in the City

We are asked to count the number of subsets of intersections in a tree such that, if we declare exactly the intersections in the subset as dangerous, no simple path in the tree contains three or more dangerous intersections.
codeforces competitive-programming combinatorics dp math trees Jun 9, 2026
Practice › Codeforces Solutions › Codeforces Round 926 (Div. 2) ›

CF 1929B - Sasha and the Drawing

We have an $n times n$ grid. Every cell belongs to exactly one diagonal of each of the two diagonal directions. The problem counts both directions, so the grid contains a total of $2n-1$ diagonals of one type and $2n-1$ diagonals of the other type, for a total of $4n-2$…
codeforces competitive-programming constructive-algorithms greedy math Jun 9, 2026
Practice › Codeforces Solutions › Codeforces Round 926 (Div. 2) ›

CF 1929A - Sasha and the Beautiful Array

We are given an array of integers, and we may rearrange its elements in any order. The beauty of a particular arrangement is defined as the sum of differences between consecutive elements: $$(a2-a1)+(a3-a2)+cdots+(an-a{n-1})$$ Our task is to choose the ordering that produces…
codeforces competitive-programming constructive-algorithms greedy math sortings Jun 8, 2026