Codeforces Round 710 (Div. 3)

Solutions for Codeforces Round 710 (Div. 3) (contest 1506). 4/7 problems verified against sample I/O. Difficulty range: 800-2000.

7 items

Codeforces Round 710 (Div. 3)

Type: Div. 3 | Problems: 7 | Verified: 4/7 | Rating range: 800-2000 | Time: 19m 58s

Problem Name Rating Tags Solve Time Verified
A Strange Table 800 math 1m 53s ✓
B Partial Replacement 1100 greedy, implementation 7m 39s ✓
C Double-ended Strings 1000 brute-force, implementation, strings 57s ✗
D Epic Transformation 1400 constructive-algorithms, data-structures, greedy 2m 21s ✓
E Restoring the Permutation 1500 constructive-algorithms, implementation 2m 55s ✗
F Triangular Paths 2000 constructive-algorithms, graphs, math 2m 15s ✗
G Maximize the Remaining String 2000 brute-force, data-structures, dp 1m 58s ✓
Practice › Codeforces Solutions › Codeforces Round 710 (Div. 3) ›

CF 1506B - Partial Replacement

The proposed algorithm is not suffering from a small implementation bug. The underlying construction is wrong. We can see this immediately on the failing cases. For n = 1, the total number of almost sorted permutations is exactly 1.
codeforces competitive-programming greedy implementation Jun 10, 2026
Practice › Codeforces Solutions › Codeforces Round 710 (Div. 3) ›

CF 1506G - Maximize the Remaining String

We are given a string of lowercase letters. We are allowed to repeatedly delete characters, but with a restriction: we can only delete a character if that character still appears somewhere else in the string.
codeforces competitive-programming brute-force data-structures dp greedy strings Jun 10, 2026
Practice › Codeforces Solutions › Codeforces Round 710 (Div. 3) ›

CF 1506F - Triangular Paths

We are working with an infinite triangular grid where each point is identified by coordinates $(r, c)$, with row $r$ containing $r$ nodes. Each node has exactly one outgoing directed edge going either down-left to $(r+1, c)$ or down-right to $(r+1, c+1)$.
codeforces competitive-programming constructive-algorithms graphs math shortest-paths sortings Jun 10, 2026
Practice › Codeforces Solutions › Codeforces Round 710 (Div. 3) ›

CF 1506E - Restoring the Permutation

We are given an array q derived from an unknown permutation p of numbers from 1 to n using the rule qi = max(p1, ..., pi). Our task is to reconstruct two permutations that could have produced this q: one that is lexicographically minimal and one that is lexicographically maximal.
codeforces competitive-programming constructive-algorithms implementation Jun 10, 2026
Practice › Codeforces Solutions › Codeforces Round 710 (Div. 3) ›

CF 1506D - Epic Transformation

We are given an array of integers, and we are allowed to repeatedly remove pairs of elements that are different from each other. Our task is to determine the smallest size the array can have after applying this operation any number of times.
codeforces competitive-programming constructive-algorithms data-structures greedy Jun 10, 2026
Practice › Codeforces Solutions › Codeforces Round 710 (Div. 3) ›

CF 1506A - Strange Table

We are given a rectangular grid with $n$ rows and $m$ columns. Each cell contains a unique number from $1$ to $n cdot m$, but the numbering is defined in two different ways. First, imagine filling the grid column by column.
codeforces competitive-programming math Jun 10, 2026
Practice › Codeforces Solutions › Codeforces Round 710 (Div. 3) ›

CF 1506C - Double-ended Strings

Something went wrong while generating the response. If this issue persists please contact us through our help center at [help.openai.com](https://help.openai.com/).
codeforces competitive-programming brute-force implementation strings Jun 10, 2026