Codeforces Round 1059 (Div. 3)

8 problems from Codeforces Round 1059 (Div. 3) (contest 2162), difficulty 800-2900. 2/8 solutions verified against sample I/O.

8 items

Codeforces Round 1059 (Div. 3)

Div. 3 | 8 problems | 2/8 verified | Difficulty 800-2900 | 13m 30s

# Problem Rating Tags Accepted Time ✓
A Beautiful Average 800 brute-force, greedy 41,574 1m 37s ✓
B Beautiful String 1000 brute-force, constructive-algorithms 27,889 1m 39s
C Beautiful XOR 1100 bitmasks, constructive-algorithms, greedy 21,311 2m 13s
D Beautiful Permutation 1400 binary-search, interactive 12,358 1m 31s
E Beautiful Palindromes 1600 constructive-algorithms, greedy, schedules 9,329 1m 32s
F Beautiful Intervals 2100 constructive-algorithms, greedy 2,913 1m 37s
G Beautiful Tree 2200 constructive-algorithms, math, probabilities 2,810 1m 37s ✓
H Beautiful Problem 2900 dp 313 1m 44s
Practice › Codeforces Solutions › Codeforces Round 1059 (Div. 3) ›

CF 2162H - Beautiful Problem

We are given an array whose values are fixed, but we are allowed to permute them arbitrarily before answering queries. Alongside this array, we are also given several index ranges.
codeforces competitive-programming dp Jun 7, 2026
Practice › Codeforces Solutions › Codeforces Round 1059 (Div. 3) ›

CF 2162G - Beautiful Tree

We are asked to construct a labeled tree with $n$ vertices such that the sum of the products of the labels of each edge is a perfect square. Formally, if the tree has edges $(u, v)$, we compute $S = sum (u cdot v)$, and $S$ must equal $x^2$ for some integer $x$.
codeforces competitive-programming constructive-algorithms math probabilities trees Jun 7, 2026
Practice › Codeforces Solutions › Codeforces Round 1059 (Div. 3) ›

CF 2162F - Beautiful Intervals

We are given several test cases. In each test case, we must construct a permutation of the numbers from 0 to n−1. Think of this permutation as placing each number exactly once on a line of length n. On top of this array, we are given m intervals.
codeforces competitive-programming constructive-algorithms greedy Jun 7, 2026
Practice › Codeforces Solutions › Codeforces Round 1059 (Div. 3) ›

CF 2162E - Beautiful Palindromes

We are given an array of integers between 1 and n and an integer k. We are allowed to append exactly k numbers to the end of this array.
codeforces competitive-programming constructive-algorithms greedy schedules Jun 7, 2026
Practice › Codeforces Solutions › Codeforces Round 1059 (Div. 3) ›

CF 2162D - Beautiful Permutation

We are given a hidden permutation of size $n$, meaning it contains each number from $1$ to $n$ exactly once. After this permutation was fixed, someone chose a segment $[l, r]$ and increased every element inside that segment by exactly one.
codeforces competitive-programming binary-search interactive Jun 7, 2026
Practice › Codeforces Solutions › Codeforces Round 1059 (Div. 3) ›

CF 2162C - Beautiful XOR

We are given two integers a and b. We can repeatedly pick an integer x such that 0 ≤ x ≤ a (the current value of a) and replace a with a XOR x.
codeforces competitive-programming bitmasks constructive-algorithms greedy Jun 7, 2026
Practice › Codeforces Solutions › Codeforces Round 1059 (Div. 3) ›

CF 2162B - Beautiful String

We are given a binary string s of length n, which means it contains only '0' and '1'. The task is to select a subsequence p from s such that two conditions hold: first, p must be non-decreasing (so all '0's must appear before any '1's in p), and second, if we remove all…
codeforces competitive-programming brute-force constructive-algorithms Jun 7, 2026
Practice › Codeforces Solutions › Codeforces Round 1059 (Div. 3) ›

CF 2162A - Beautiful Average

We are given an array of integers, each between 1 and 10, and we are asked to find the maximum average of any contiguous subarray. A subarray is simply a consecutive segment of the array, which can be as short as a single element or as long as the entire array.
codeforces competitive-programming brute-force greedy Jun 7, 2026