Codeforces Round 1043 (Div. 3)

8 problems from Codeforces Round 1043 (Div. 3) (contest 2132), difficulty 800-2600. 5/8 solutions verified against sample I/O.

8 items

Codeforces Round 1043 (Div. 3)

Div. 3 | 8 problems | 5/8 verified | Difficulty 800-2600 | 13m 38s

# Problem Rating Tags Accepted Time ✓
A Homework 800 brute-force, implementation, strings 43,322 1m 43s ✓
B The Secret Number 900 math 33,533 1m 38s
C1 The Cunning Seller (easy version) 1000 greedy, math 27,723 1m 24s ✓
C2 The Cunning Seller (hard version) 1400 binary-search, greedy, math 13,328 2m 47s ✓
D From 1 to Infinity 1600 binary-search, dp, implementation 8,814 1m 15s ✓
E Arithmetics Competition 1700 binary-search, data-structures, greedy 7,585 1m 37s ✓
F Rada and the Chamomile Valley 2100 dfs-and-similar, graphs, shortest-paths 2,768 1m 41s
G Famous Choreographer 2600 hashing, implementation, strings 514 1m 33s
Practice › Codeforces Solutions › Codeforces Round 1043 (Div. 3) ›

CF 2132G - Famous Choreographer

We are given a rectangular grid of ballerinas, each performing one of 26 possible movements represented by lowercase English letters. Conceptually, each row is a string, and the entire grid is an array of strings.
codeforces competitive-programming hashing implementation strings Jun 8, 2026
Practice › Codeforces Solutions › Codeforces Round 1043 (Div. 3) ›

CF 2132F - Rada and the Chamomile Valley

We are asked to analyze a connected undirected graph representing the Chamomile Valley, where nodes are houses and edges are lanes between them. Rada wants to know which lanes are guaranteed to be part of every shortest path from house 1 to house n.
codeforces competitive-programming dfs-and-similar graphs shortest-paths Jun 8, 2026
Practice › Codeforces Solutions › Codeforces Round 1043 (Div. 3) ›

CF 2132C2 - The Cunning Seller (hard version)

Each deal lets us buy exactly $3^x$ watermelons for $$3^{x+1} + x cdot 3^{x-1}$$ coins. We need to buy exactly $n$ watermelons. We may use at most $k$ deals. Among all valid ways to do that, we want the minimum total cost.
codeforces competitive-programming binary-search greedy math Jun 8, 2026
Practice › Codeforces Solutions › Codeforces Round 1043 (Div. 3) ›

CF 2132E - Arithmetics Competition

The problem presents a team of two players, Vadim and Kostya, who each have a collection of cards with numeric values.
codeforces competitive-programming binary-search data-structures greedy sortings ternary-search Jun 8, 2026
Practice › Codeforces Solutions › Codeforces Round 1043 (Div. 3) ›

CF 2132D - From 1 to Infinity

We are asked to consider an infinite string formed by writing all positive integers consecutively: 123456789101112... and so on. For each test case, we are given a number k representing the number of digits to take from the start of this infinite string.
codeforces competitive-programming binary-search dp implementation math Jun 8, 2026
Practice › Codeforces Solutions › Codeforces Round 1043 (Div. 3) ›

CF 2132A - Homework

We start with a string a. Another string b contains characters that must be inserted one by one, in the order they appear. For every position i in b, the corresponding character c[i] tells us who inserts that character.
codeforces competitive-programming brute-force implementation strings Jun 8, 2026
Practice › Codeforces Solutions › Codeforces Round 1043 (Div. 3) ›

CF 2132B - The Secret Number

We are given a number $n$ that was constructed in a very specific way. Someone secretly chose an integer $x$, then created another number $y$ by appending one or more zeros to the right of $x$. That means $y = x cdot 10^k$ for some $k ge 1$.
codeforces competitive-programming math Jun 8, 2026
Practice › Codeforces Solutions › Codeforces Round 1043 (Div. 3) ›

CF 2132C1 - The Cunning Seller (easy version)

The problem gives us a seller who offers watermelons in bundles of sizes that are powers of three. Each bundle of size $3^x$ costs $3^{x+1} + x cdot 3^{x-1}$ coins.
codeforces competitive-programming greedy math Jun 8, 2026