Codeforces Round 724 (Div. 2)

6 problems from Codeforces Round 724 (Div. 2) (contest 1536), difficulty 800-2600. 2/6 solutions verified against sample I/O.

6 items

Codeforces Round 724 (Div. 2)

Div. 2 | 6 problems | 2/6 verified | Difficulty 800-2600 | 21m 12s

# Problem Rating Tags Accepted Time ✓
A Omkar and Bad Story 800 brute-force, constructive-algorithms 20,771 1m 42s
B Prinzessin der Verurteilung 1200 brute-force, constructive-algorithms, strings 25,013 2m 40s ✓
C Diluc and Kaeya 1500 data-structures, dp, hashing 16,117 3m 49s
D Omkar and Medians 2000 data-structures, greedy, implementation 5,056 3m 44s
E Omkar and Forest 2300 combinatorics, graphs, math 2,734 6m 54s
F Omkar and Akmar 2600 chinese-remainder-theorem, combinatorics, constructive-algorithms 1,102 2m 23s ✓
Practice › Codeforces Solutions › Codeforces Round 724 (Div. 2) ›

CF 1536E - Omkar and Forest

We are given a grid where some cells are forced to be zero and the rest are flexible cells that may take any non-negative integer value.
codeforces competitive-programming combinatorics graphs math shortest-paths Jun 14, 2026
Practice › Codeforces Solutions › Codeforces Round 724 (Div. 2) ›

CF 1536D - Omkar and Medians

We are given a sequence b which is claimed to come from a hidden process involving another array a. The process builds a step by step in odd lengths: at step i, we look at the first 2i-1 elements of a, compute their median, and store it as b[i].
codeforces competitive-programming data-structures greedy implementation Jun 14, 2026
Practice › Codeforces Solutions › Codeforces Round 724 (Div. 2) ›

CF 1536C - Diluc and Kaeya

We are given a binary string made only of the characters D and K. For every prefix of this string, we want to determine how finely we can split that prefix into contiguous pieces such that every piece has the same internal balance between D and K.
codeforces competitive-programming data-structures dp hashing number-theory Jun 14, 2026
Practice › Codeforces Solutions › Codeforces Round 724 (Div. 2) ›

CF 1536B - Prinzessin der Verurteilung

We are given a short lowercase string and asked to find a very specific “missing pattern” inside it. The task is to identify the shortest possible string over lowercase letters that does not appear anywhere as a contiguous substring of the given input.
codeforces competitive-programming brute-force constructive-algorithms strings Jun 14, 2026
Practice › Codeforces Solutions › Codeforces Round 724 (Div. 2) ›

CF 1536A - Omkar and Bad Story

We are given a small set of distinct integers and are allowed to add new distinct integers to it. The goal is to build a final set such that it satisfies a very strong closure property: whenever we pick any two numbers from the set, the absolute difference between them must…
codeforces competitive-programming brute-force constructive-algorithms Jun 14, 2026
Practice › Codeforces Solutions › Codeforces Round 724 (Div. 2) ›

CF 1536F - Omkar and Akmar

We are asked to count all possible distinct games played on a circular board with $n$ cells, where two players take turns placing letters A or B. Akmar moves first. A letter cannot be placed adjacent to a cell that already contains the same letter.
codeforces competitive-programming chinese-remainder-theorem combinatorics constructive-algorithms fft games geometry math meet-in-the-middle string-suffix-structures Jun 10, 2026