Codeforces Round 992 (Div. 2)

6 problems from Codeforces Round 992 (Div. 2) (contest 2040), difficulty 800-2700. 1/6 solutions verified against sample I/O.

6 items

Codeforces Round 992 (Div. 2)

Div. 2 | 6 problems | 1/6 verified | Difficulty 800-2700 | 13m 11s

# Problem Rating Tags Accepted Time ✓
A Game of Division 800 games, math 24,432 1m 17s
B Paint a Strip 1000 constructive-algorithms, greedy, math 24,099 2m 28s
C Ordered Permutations 1600 bitmasks, combinatorics, constructive-algorithms 10,776 2m 2s
D Non Prime Tree 1900 brute-force, constructive-algorithms, dfs-and-similar 5,847 3m 17s
E Control of Randomness 2100 combinatorics, dfs-and-similar, dp 2,670 2m 6s
F Number of Cubes 2700 combinatorics, dp, math 459 2m 1s ✓
Practice › Codeforces Solutions › Codeforces Round 992 (Div. 2) ›

CF 2040D - Non Prime Tree

We are given a tree with $n$ vertices, and we must assign each vertex a distinct integer from the range $1$ to $2n$, using exactly $n$ of those numbers. The assignment is arbitrary except that every vertex gets a unique value.
codeforces competitive-programming brute-force constructive-algorithms dfs-and-similar greedy number-theory trees two-pointers Jun 8, 2026
Practice › Codeforces Solutions › Codeforces Round 992 (Div. 2) ›

CF 2040F - Number of Cubes

We have an $a times b times c$ toroidal grid of unit cubes. Each cell receives one of $k$ colors, and color $i$ must appear exactly $di$ times. Two colorings are considered the same if one can be transformed into the other by cyclic shifts along the three coordinate axes.
codeforces competitive-programming combinatorics dp math number-theory Jun 8, 2026
Practice › Codeforces Solutions › Codeforces Round 992 (Div. 2) ›

CF 2040E - Control of Randomness

We are given a tree, an undirected connected acyclic graph, with n vertices rooted at vertex 1. A robot starts at some vertex v ≠ 1 and moves toward the root. Odd-numbered steps are deterministic: the robot always moves one step along a shortest path toward vertex 1.
codeforces competitive-programming combinatorics dfs-and-similar dp graphs greedy math probabilities trees Jun 8, 2026
Practice › Codeforces Solutions › Codeforces Round 992 (Div. 2) ›

CF 2040B - Paint a Strip

Codeforces 2040B: Paint a Strip
codeforces competitive-programming constructive-algorithms greedy math Jun 8, 2026
Practice › Codeforces Solutions › Codeforces Round 992 (Div. 2) ›

CF 2040C - Ordered Permutations

We are asked to work with permutations of numbers from 1 to n, and each permutation has a sum defined by taking every contiguous subarray and adding its minimum. Among all permutations of length n, some permutations maximize this sum.
codeforces competitive-programming bitmasks combinatorics constructive-algorithms greedy math two-pointers Jun 8, 2026
Practice › Codeforces Solutions › Codeforces Round 992 (Div. 2) ›

CF 2040A - Game of Division

We are looking at a decision problem where one player tries to “trap” another player using modular arithmetic on array values. We are given an array of integers. The first player picks a single position in the array and commits to that value.
codeforces competitive-programming games math Jun 8, 2026