Codeforces Round 582 (Div. 3)

8 problems from Codeforces Round 582 (Div. 3) (contest 1213), difficulty 900-2100. 7/8 solutions verified against sample I/O.

8 items

Codeforces Round 582 (Div. 3)

Div. 3 | 8 problems | 7/8 verified | Difficulty 900-2100 | 24m 43s

# Problem Rating Tags Accepted Time ✓
A Chips Moving 900 math 25,602 1m 54s ✓
B Bad Prices 1100 data-structures, implementation 31,550 1m 20s ✓
C Book Reading 1200 math 19,621 1m 36s ✓
D1 Equalizing by Division (easy version) 1500 brute-force, implementation 12,077 3m 32s ✓
D2 Equalizing by Division (hard version) 1600 brute-force, math, sortings 12,194 1m 46s ✓
E Two Small Strings 1900 brute-force, constructive-algorithms 5,464 4m 59s
F Unstable String Sort 2100 data-structures, dfs-and-similar, dsu 3,020 5m 5s ✓
G Path Queries 1800 divide-and-conquer, dsu, graphs 9,524 4m 31s ✓
Practice › Codeforces Solutions › Codeforces Round 582 (Div. 3) ›

CF 1213F - Unstable String Sort

We are given two permutations of the indices of a string, and both permutations describe an ordering in which the hidden string must appear sorted.
codeforces competitive-programming data-structures dfs-and-similar dsu graphs greedy implementation strings Jun 15, 2026
Practice › Codeforces Solutions › Codeforces Round 582 (Div. 3) ›

CF 1213E - Two Small Strings

We are asked to build a string of length $3n$ over the alphabet ${a,b,c}$, where each character appears exactly $n$ times. In addition to this balancing constraint, two forbidden patterns are given, each being a length-2 string.
codeforces competitive-programming brute-force constructive-algorithms Jun 15, 2026
Practice › Codeforces Solutions › Codeforces Round 582 (Div. 3) ›

CF 1213A - Chips Moving

We are given several chips placed on integer positions on a line. Our goal is to move all chips so that they end up on a single shared coordinate, using the cheapest possible sequence of moves. Each chip can move in two different ways.
codeforces competitive-programming math Jun 15, 2026
Practice › Codeforces Solutions › Codeforces Round 582 (Div. 3) ›

CF 1213G - Path Queries

We are given a weighted tree where every edge has a cost, and we are asked multiple questions about how “expensive” paths between pairs of vertices can be. For any two vertices $u$ and $v$, there is exactly one simple path between them because the graph is a tree.
codeforces competitive-programming divide-and-conquer dsu graphs sortings trees Jun 13, 2026
Practice › Codeforces Solutions › Codeforces Round 582 (Div. 3) ›

CF 1213D1 - Equalizing by Division (easy version)

We are given a list of integers, and we are allowed to repeatedly reduce any chosen number by replacing it with its half rounded down. Each such replacement costs one operation.
codeforces competitive-programming brute-force implementation Jun 13, 2026
Practice › Codeforces Solutions › Codeforces Round 582 (Div. 3) ›

CF 1213D2 - Equalizing by Division (hard version)

We are given an array of integers, and we can repeatedly pick any number and divide it by two, rounding down. The goal is to find the minimum number of such operations required to make at least $k$ numbers in the array equal.
codeforces competitive-programming brute-force math sortings Jun 11, 2026
Practice › Codeforces Solutions › Codeforces Round 582 (Div. 3) ›

CF 1213C - Book Reading

We are asked to compute a sum of last digits of page numbers divisible by a given integer. Polycarp reads a book with pages numbered from 1 to n. Every page number divisible by m gets recorded, but only its last digit is written.
codeforces competitive-programming math Jun 11, 2026
Practice › Codeforces Solutions › Codeforces Round 582 (Div. 3) ›

CF 1213B - Bad Prices

We are given several independent experiments, and each experiment consists of a sequence of daily prices of a product.
codeforces competitive-programming data-structures implementation Jun 11, 2026