Codeforces Round 1046 (Div. 1)

8 problems from Codeforces Round 1046 (Div. 1) (contest 2135), difficulty 1200-3500. 0/8 solutions verified against sample I/O.

8 items

Codeforces Round 1046 (Div. 1)

Div. 1 | 8 problems | 0/8 verified | Difficulty 1200-3500 | 14m 1s

# Problem Rating Tags Accepted Time ✓
A Against the Difference 1200 data-structures, dp 18,322 1m 59s
B For the Champion 1700 constructive-algorithms, interactive, math 7,334 1m 49s
C By the Assignment 2000 binary-search, bitmasks, combinatorics 3,881 1m 52s
D1 From the Unknown (Easy Version) 2100 constructive-algorithms, interactive, math 2,433 1m 33s
D2 From the Unknown (Hard Version) 2500 brute-force, constructive-algorithms, interactive 990 2m 3s
E1 Beyond the Palindrome (Easy Version) 3300 combinatorics, dp, math 247 1m 34s
E2 Beyond the Palindrome (Hard Version) 3500 combinatorics, dp, math 166 1m 23s
F To the Infinity 3500 data-structures, hashing, math 246 1m 48s
Practice › Codeforces Solutions › Codeforces Round 1046 (Div. 1) ›

CF 2135F - To the Infinity

We are given a rooted full binary tree where every node represents a function built recursively from its children. Leaves behave simply: their function is just the identity map $fu(x) = x$.
codeforces competitive-programming data-structures hashing math trees Jun 8, 2026
Practice › Codeforces Solutions › Codeforces Round 1046 (Div. 1) ›

CF 2135E2 - Beyond the Palindrome (Hard Version)

We are asked to count binary strings of a given length that are almost-palindromes under a specific transformation. For a binary string, repeatedly deleting all occurrences of the substring 10 yields a "reduced" string.
codeforces competitive-programming combinatorics dp math number-theory Jun 8, 2026
Practice › Codeforces Solutions › Codeforces Round 1046 (Div. 1) ›

CF 2135D2 - From the Unknown (Hard Version)

The task is to determine the unknown width parameter $W$ of a text editor. The editor displays a sequence of words, each represented by its length, on lines of width $W$.
codeforces competitive-programming brute-force constructive-algorithms interactive math Jun 8, 2026
Practice › Codeforces Solutions › Codeforces Round 1046 (Div. 1) ›

CF 2135E1 - Beyond the Palindrome (Easy Version)

We are asked to count a specific subset of binary strings of length $n$, which are called almost-palindromes. The key to understanding this problem is the function $f(r)$, which repeatedly deletes all occurrences of the substring 10 from a binary string $r$ until no 10 remains.
codeforces competitive-programming combinatorics dp math Jun 8, 2026
Practice › Codeforces Solutions › Codeforces Round 1046 (Div. 1) ›

CF 2135D1 - From the Unknown (Easy Version)

We are trying to determine an unknown integer parameter $W$, the width of lines in a text editor. Each article we submit is a sequence of positive integers representing word lengths.
codeforces competitive-programming constructive-algorithms interactive math Jun 8, 2026
Practice › Codeforces Solutions › Codeforces Round 1046 (Div. 1) ›

CF 2135A - Against the Difference

We are given an array of integers, and we want to find the length of the longest subsequence that can be split into "blocks". A block is defined as a contiguous sequence where every element equals the length of that sequence.
codeforces competitive-programming data-structures dp Jun 8, 2026
Practice › Codeforces Solutions › Codeforces Round 1046 (Div. 1) ›

CF 2135C - By the Assignment

We are given a connected undirected graph where each vertex may have a weight, but some weights are missing and represented by -1. The goal is to fill in the missing weights such that the graph becomes balanced.
codeforces competitive-programming binary-search bitmasks combinatorics dfs-and-similar dsu graphs math Jun 8, 2026
Practice › Codeforces Solutions › Codeforces Round 1046 (Div. 1) ›

CF 2135B - For the Champion

The original problem is interactive. We know a set of anchor points, and there is a hidden robot position. By moving the robot and observing the minimum Manhattan distance to any anchor, we must recover the initial coordinates.
codeforces competitive-programming constructive-algorithms interactive math Jun 8, 2026