Codeforces Round 1032 (Div. 3)

8 problems from Codeforces Round 1032 (Div. 3) (contest 2121), difficulty 800-1900. 4/8 solutions verified against sample I/O.

8 items

Codeforces Round 1032 (Div. 3)

Div. 3 | 8 problems | 4/8 verified | Difficulty 800-1900 | 11m 48s

# Problem Rating Tags Accepted Time ✓
A Letter Home 800 brute-force, math 39,266 1m 10s ✓
B Above the Clouds 800 constructive-algorithms, greedy, strings 32,489 1m 27s
C Those Who Are With Us 1200 greedy, implementation 21,733 1m 34s ✓
D 1709 1300 implementation, sortings 18,197 1m 44s
E Sponsor of Your Problems 1500 dp, greedy, implementation 14,679 1m 14s ✓
F Yamakasi 1800 binary-search, brute-force, data-structures 8,117 3m 1s ✓
G Gangsta 1900 data-structures, divide-and-conquer, math 5,359 1m 38s
H Ice Baby 2,240
Practice › Codeforces Solutions › Codeforces Round 1032 (Div. 3) ›

Practice › Codeforces Solutions › Codeforces Round 1032 (Div. 3) ›

CF 2121F - Yamakasi

We are given an integer array and, for each test case, two target values: a required subarray sum s and a required maximum value x. The task is to count how many contiguous subarrays have total sum exactly equal to s and whose largest element is exactly x.
codeforces competitive-programming binary-search brute-force data-structures greedy two-pointers Jun 8, 2026
Practice › Codeforces Solutions › Codeforces Round 1032 (Div. 3) ›

CF 2121G - Gangsta

We are asked to process a binary string and compute, for every contiguous substring, the maximum frequency of either 0 or 1 in that substring, then sum these values across all substrings.
codeforces competitive-programming data-structures divide-and-conquer math sortings Jun 8, 2026
Practice › Codeforces Solutions › Codeforces Round 1032 (Div. 3) ›

CF 2121D - 1709

We are given two arrays, a and b, each of length n, containing all integers from 1 to 2n exactly once between them. The task is to rearrange the arrays using three types of swaps so that a is strictly increasing, b is strictly increasing, and at each position i, a[i] < b[i].
codeforces competitive-programming implementation sortings Jun 8, 2026
Practice › Codeforces Solutions › Codeforces Round 1032 (Div. 3) ›

CF 2121E - Sponsor of Your Problems

We are given two integers of equal length in decimal form, and we are allowed to pick any integer x that lies within the inclusive range between them.
codeforces competitive-programming dp greedy implementation strings Jun 8, 2026
Practice › Codeforces Solutions › Codeforces Round 1032 (Div. 3) ›

CF 2121C - Those Who Are With Us

We are given a rectangular grid of integers. In one move, we pick a single row and a single column. Every cell that lies in that chosen row or that chosen column gets decreased by one, with the intersection cell counted only once.
codeforces competitive-programming greedy implementation Jun 8, 2026
Practice › Codeforces Solutions › Codeforces Round 1032 (Div. 3) ›

CF 2121B - Above the Clouds

We are asked to determine, for a given string, whether it is possible to split it into three non-empty parts, $a$, $b$, and $c$, such that $a + b + c = s$ and the middle segment $b$ appears as a substring of the concatenation $a + c$.
codeforces competitive-programming constructive-algorithms greedy strings Jun 8, 2026
Practice › Codeforces Solutions › Codeforces Round 1032 (Div. 3) ›

CF 2121A - Letter Home

We are given a set of distinct integer positions on the number line and a starting position. From the starting position, we can move left or right by one unit at a time.
codeforces competitive-programming brute-force math Jun 8, 2026