Codeforces Round 1014 (Div. 2)

6 problems from Codeforces Round 1014 (Div. 2) (contest 2092), difficulty 800-2900. 1/6 solutions verified against sample I/O.

6 items

Codeforces Round 1014 (Div. 2)

Div. 2 | 6 problems | 1/6 verified | Difficulty 800-2900 | 9m 34s

# Problem Rating Tags Accepted Time ✓
A Kamilka and the Sheep 800 greedy, math, number-theory 28,313 1m 17s ✓
B Lady Bug 1000 brute-force, constructive-algorithms, implementation 24,803 1m 38s
C Asuna and the Mosquitoes 1200 constructive-algorithms, greedy, math 22,573 2m 9s
D Mishkin Energizer 1800 brute-force, constructive-algorithms, greedy 6,880 1m 34s
E She knows... 2100 combinatorics, constructive-algorithms, graphs 3,842 1m 35s
F Andryusha and CCB 2900 brute-force, constructive-algorithms, greedy 432 1m 21s
Practice › Codeforces Solutions › Codeforces Round 1014 (Div. 2) ›

CF 2092F - Andryusha and CCB

We are given a binary string that represents a pie, and we need to split it into contiguous segments such that each segment has the same "beauty." The beauty of a string is defined as the number of places where consecutive characters differ.
codeforces competitive-programming brute-force constructive-algorithms greedy math number-theory strings Jun 8, 2026
Practice › Codeforces Solutions › Codeforces Round 1014 (Div. 2) ›

CF 2092E - She knows...

The board is an enormous $n times m$ grid where almost every cell is initially uncolored (“green”), except for $k$ cells that are already fixed as either black or white. We are allowed to assign a color to every remaining green cell.
codeforces competitive-programming combinatorics constructive-algorithms graphs math Jun 8, 2026
Practice › Codeforces Solutions › Codeforces Round 1014 (Div. 2) ›

CF 2092D - Mishkin Energizer

We are given a string representing a drink, made of the letters L, I, and T, each corresponding to a component. The drink is "balanced" when the number of each character is equal. Edmond can insert new letters between two consecutive, different characters.
codeforces competitive-programming brute-force constructive-algorithms greedy implementation strings Jun 8, 2026
Practice › Codeforces Solutions › Codeforces Round 1014 (Div. 2) ›

CF 2092C - Asuna and the Mosquitoes

We are given a collection of towers, each with a positive integer height, representing gifts from Asuna's admirers. Asuna evaluates the beauty of her gifts as the height of the tallest tower.
codeforces competitive-programming constructive-algorithms greedy math Jun 8, 2026
Practice › Codeforces Solutions › Codeforces Round 1014 (Div. 2) ›

CF 2092B - Lady Bug

We are given two bit strings of equal length, a and b, representing a password. Lady Bug wants to transform the first string a so that it contains only zeros.
codeforces competitive-programming brute-force constructive-algorithms implementation math Jun 8, 2026
Practice › Codeforces Solutions › Codeforces Round 1014 (Div. 2) ›

CF 2092A - Kamilka and the Sheep

We are given a list of sheep, each with a distinct beauty level. Kamilka can feed every sheep the same number of extra grass bunches, effectively increasing all beauty levels by the same integer $d ge 0$.
codeforces competitive-programming greedy math number-theory sortings Jun 8, 2026