Codeforces Round 727 (Div. 2)

Solutions for Codeforces Round 727 (Div. 2) (contest 1539). 1/6 problems verified against sample I/O. Difficulty range: 800-2600.

6 items

Codeforces Round 727 (Div. 2)

Type: Div. 2 | Problems: 6 | Verified: 1/6 | Rating range: 800-2600 | Time: 28m 48s

Problem Name Rating Tags Solve Time Verified
A Contest Start 1000 combinatorics, geometry, greedy 2m 57s ✗
B Love Song 800 dp, implementation, strings 8m 22s ✗
C Stable Groups 1200 greedy, sortings 8m 27s ✗
D PriceFixed 1600 binary-search, greedy, implementation 4m 28s ✓
E Game with Cards 2500 binary-search, constructive-algorithms, data-structures 2m 5s ✗
F Strange Array 2600 data-structures, greedy, sortings 2m 29s ✗
Practice › Codeforces Solutions › Codeforces Round 727 (Div. 2) ›

CF 1539F - Strange Array

The solution attempts to prove the lower bound on the true remainder when the trial quotient $hat q$ underestimates the true quotient $q$ by 1. It correctly identifies that $hat q = q-1$ under the hypotheses and expresses the true remainder as $r = hat r - v$.
codeforces competitive-programming data-structures greedy sortings Jun 10, 2026
Practice › Codeforces Solutions › Codeforces Round 727 (Div. 2) ›

CF 1539E - Game with Cards

Represent each integer in base $b$ as a doubly linked list of digits $$(v{n-1}, v{n-2}, dots, v0),$$ where each node contains one digit $vi in {0, dots, b-1}$, together with pointers $$text{left}(i), text{right}(i)$$ to adjacent digits.
codeforces competitive-programming binary-search constructive-algorithms data-structures dp greedy implementation Jun 10, 2026
Practice › Codeforces Solutions › Codeforces Round 727 (Div. 2) ›

CF 1539C - Stable Groups

We are given the skill levels of students. A group is considered stable if, after sorting the students inside that group, every adjacent pair differs by at most x.
codeforces competitive-programming greedy sortings Jun 10, 2026
Practice › Codeforces Solutions › Codeforces Round 727 (Div. 2) ›

CF 1539B - Love Song

We are given a lowercase string representing the song and many queries on contiguous substrings of that string. Each letter contributes a value equal to its position in the alphabet. For example, a = 1, b = 2, c = 3, and so on.
codeforces competitive-programming dp implementation strings Jun 10, 2026
Practice › Codeforces Solutions › Codeforces Round 727 (Div. 2) ›

CF 1539D - PriceFixed

We are asked to determine the minimal total cost for Lena to buy a set of products where each product has a required quantity and a threshold for a discount.
codeforces competitive-programming binary-search greedy implementation sortings two-pointers Jun 10, 2026
Practice › Codeforces Solutions › Codeforces Round 727 (Div. 2) ›

CF 1539A - Contest Start

Represent each integer in base $b$ as a doubly linked list of digits $$(v{n-1}, v{n-2}, dots, v0),$$ where each node contains one digit $vi in {0, dots, b-1}$, together with pointers $$text{left}(i), text{right}(i)$$ to adjacent digits.
codeforces competitive-programming combinatorics geometry greedy math Jun 10, 2026