Codeforces Round 1064 (Div. 2)

Solutions for Codeforces Round 1064 (Div. 2) (contest 2166). 2/6 problems verified against sample I/O. Difficulty range: 800-2500.

6 items

Codeforces Round 1064 (Div. 2)

Type: Div. 2 | Problems: 6 | Verified: 2/6 | Rating range: 800-2500 | Time: 12m 55s

Problem Name Rating Tags Solve Time Verified
A Same Difference 800 brute-force, greedy, strings 1m 40s ✗
B Tab Closing 900 math 4m 49s ✗
C Cyclic Merging 1300 constructive-algorithms, data-structures, dsu 1m 19s ✓
D Marble Council 1900 dp, math 1m 52s ✗
E Binary Wine 2000 bitmasks, dp, greedy 1m 48s ✗
F Path Split 2500 data-structures, graph-matchings, greedy 1m 27s ✓
Practice › Codeforces Solutions › Codeforces Round 1064 (Div. 2) ›

CF 2166B - Tab Closing

<Title valuea). If there are currently (="Solution Editorial"m) tabs open, every tab has length [ size="2xl"/<Title value="Problem Understanding" size="text{len} = minleft(b,frac{a}{m}right).
codeforces competitive-programming math Jun 9, 2026
Practice › Codeforces Solutions › Codeforces Round 1064 (Div. 2) ›

CF 2166F - Path Split

We are given a sequence of integers, and we want to split its elements into several subsequences. Each element must belong to exactly one subsequence, and within each subsequence, consecutive chosen elements must differ by exactly one in value.
codeforces competitive-programming data-structures graph-matchings greedy Jun 9, 2026
Practice › Codeforces Solutions › Codeforces Round 1064 (Div. 2) ›

CF 2166E - Binary Wine

We are given an array of integers, and we are allowed to increase individual elements by paying a cost equal to the total number of increments we perform.
codeforces competitive-programming bitmasks dp greedy math Jun 9, 2026
Practice › Codeforces Solutions › Codeforces Round 1064 (Div. 2) ›

CF 2166D - Marble Council

We are given a multiset of integers, which is just a collection where elements can repeat. The task is to count how many different multisets can be generated by repeatedly partitioning the original multiset into any number of non-empty groups and then taking one mode from each…
codeforces competitive-programming dp math Jun 9, 2026
Practice › Codeforces Solutions › Codeforces Round 1064 (Div. 2) ›

CF 2166A - Same Difference

We are given a string of lowercase letters. In one move, we pick a position and overwrite its character with the character immediately to its right. The operation only allows copying from right to left, so information flows strictly in one direction.
codeforces competitive-programming brute-force greedy strings Jun 9, 2026
Practice › Codeforces Solutions › Codeforces Round 1064 (Div. 2) ›

CF 2166C - Cyclic Merging

We are given a set of values placed around a circle, and we repeatedly compress this circle until only one value remains.
codeforces competitive-programming constructive-algorithms data-structures dsu greedy Jun 9, 2026