Codeforces Round 1005 (Div. 2)

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

6 items

Codeforces Round 1005 (Div. 2)

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

# Problem Rating Tags Accepted Time ✓
A Brogramming Contest 800 greedy, strings 27,094 1m 35s ✓
B Variety is Discouraged 1100 binary-search, constructive-algorithms, greedy 20,116 3m 6s
C Remove the Ends 1300 brute-force, constructive-algorithms, dp 17,781 1m 33s
D Eating 1900 binary-search, bitmasks, brute-force 5,874 1m 19s ✓
E Mycraft Sand Sort 2400 combinatorics, data-structures, dsu 1,470 2m
F We Be Summing 2600 binary-search, data-structures, dp 701 1m 40s
Practice › Codeforces Solutions › Codeforces Round 1005 (Div. 2) ›

CF 2064F - We Be Summing

We are given an array of integers a of length n and a target value k. Our task is to count all contiguous subarrays of a that are epic.
codeforces competitive-programming binary-search data-structures dp two-pointers Jun 8, 2026
Practice › Codeforces Solutions › Codeforces Round 1005 (Div. 2) ›

CF 2064E - Mycraft Sand Sort

After gravity sort, the shape of the sand is completely determined by the permutation. Since $p$ is a permutation of $1 ldots n$, the final shape is always the same staircase: the first column contains $n$ blocks, the second contains $n-1$, and so on.
codeforces competitive-programming combinatorics data-structures dsu greedy math sortings Jun 8, 2026
Practice › Codeforces Solutions › Codeforces Round 1005 (Div. 2) ›

CF 2064B - Variety is Discouraged

We are given a word that is already in its singular form in a very constrained toy language. Every word is constructed from a root string, and the singular form is always created by appending the suffix “us” to that root.
codeforces competitive-programming binary-search constructive-algorithms greedy two-pointers Jun 8, 2026
Practice › Codeforces Solutions › Codeforces Round 1005 (Div. 2) ›

CF 2064D - Eating

We are given a line of slimes, each with a weight, and a special operation: a slime can eat the slime immediately to its left if its weight is at least as large, and after eating, its weight becomes the bitwise XOR of its current weight and the eaten slime's weight.
codeforces competitive-programming binary-search bitmasks brute-force data-structures dp greedy trees two-pointers Jun 8, 2026
Practice › Codeforces Solutions › Codeforces Round 1005 (Div. 2) ›

CF 2064A - Brogramming Contest

We start with a binary string s and an empty string t. A move allows us to take any suffix of one string and append it to the other string. Since only suffixes may be moved, the relative order of characters never changes. Characters can only cross the boundary between s and t.
codeforces competitive-programming greedy strings Jun 8, 2026
Practice › Codeforces Solutions › Codeforces Round 1005 (Div. 2) ›

CF 2064C - Remove the Ends

We are given an array of non-zero integers. At each step, we can pick any element, gain coins equal to its absolute value, and then either remove everything to its right if it is negative or everything to its left if it is positive.
codeforces competitive-programming brute-force constructive-algorithms dp greedy Jun 8, 2026