Codeforces Round 589 (Div. 2)

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

6 items

Codeforces Round 589 (Div. 2)

Div. 2 | 6 problems | 4/6 verified | Difficulty 800-2500 | 23m 45s

# Problem Rating Tags Accepted Time ✓
A Distinct Digits 800 brute-force, implementation 23,291 4m 3s ✓
B Filling the Grid 1400 implementation, math 11,889 5m 8s
C Primes and Multiplication 1700 math, number-theory 9,634 1m 39s ✓
D Complete Tripartite 1900 brute-force, constructive-algorithms, graphs 5,418 5m 56s ✓
E Another Filling the Grid 2300 combinatorics, dp, math 3,452 2m 31s ✓
F One Node is Gone 2500 constructive-algorithms, implementation, trees 479 4m 28s
Practice › Codeforces Solutions › Codeforces Round 589 (Div. 2) ›

CF 1228B - Filling the Grid

We are given a grid of size (h times w), initially completely empty, and two sets of constraints that describe how far blocks of filled cells must extend from the top and from the left.
codeforces competitive-programming implementation math Jun 15, 2026
Practice › Codeforces Solutions › Codeforces Round 589 (Div. 2) ›

CF 1228F - One Node is Gone

We start with a perfect binary tree of height n, meaning every internal node has exactly two children and all leaves sit at the same depth. This tree contains exactly 2^n - 1 nodes and has a very rigid recursive structure: every subtree is itself a perfect binary tree.
codeforces competitive-programming constructive-algorithms implementation trees Jun 15, 2026
Practice › Codeforces Solutions › Codeforces Round 589 (Div. 2) ›

CF 1228E - Another Filling the Grid

We are filling an $n times n$ grid with integers from $1$ to $k$. The restriction is not about individual cells, but about structure: every row must contain at least one occurrence of the value $1$, and every column must also contain at least one occurrence of $1$.
codeforces competitive-programming combinatorics dp math Jun 15, 2026
Practice › Codeforces Solutions › Codeforces Round 589 (Div. 2) ›

CF 1228D - Complete Tripartite

We are given an undirected graph with up to 100,000 vertices and up to 300,000 edges. The task is to split all vertices into exactly three non-empty groups so that the structure between every pair of groups is perfectly regular.
codeforces competitive-programming brute-force constructive-algorithms graphs hashing implementation Jun 13, 2026
Practice › Codeforces Solutions › Codeforces Round 589 (Div. 2) ›

CF 1228A - Distinct Digits

We are given a closed interval of integers from l to r, and we need to find any number inside this interval whose decimal representation does not repeat any digit. In other words, when writing the number as a string of digits, every character must be unique.
codeforces competitive-programming brute-force implementation Jun 13, 2026
Practice › Codeforces Solutions › Codeforces Round 589 (Div. 2) ›

CF 1228C - Primes and Multiplication

We are asked to compute a product over a sequence of numbers derived from a pair of integers $x$ and $n$. The function $f(x, y)$ looks at all prime factors of $x$ and for each such prime $p$ determines the largest power of $p$ that divides $y$.
codeforces competitive-programming math number-theory Jun 11, 2026