Codeforces Round 894 (Div. 3)

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

7 items

Codeforces Round 894 (Div. 3)

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

Problem Name Rating Tags Solve Time Verified
A Gift Carpet 800 dp, greedy, implementation 1m 23s ✓
B Sequence Game 800 constructive-algorithms 2m 42s ✗
C Flower City Fence 1100 binary-search, data-structures, implementation 2m 57s ✓
D Ice Cream Balls 1300 binary-search, combinatorics, constructive-algorithms 2m 49s ✗
E Kolya and Movie Theatre 1600 constructive-algorithms, data-structures, greedy 1m 34s ✓
F Magic Will Save the World 1800 binary-search, bitmasks, brute-force 1m 28s ✓
G The Great Equalizer 2000 binary-search, data-structures, math 1m 44s ✗
Practice › Codeforces Solutions › Codeforces Round 894 (Div. 3) ›

CF 1862G - The Great Equalizer

The problem presents a magical device called "The Great Equalizer" which takes an array of integers and repeatedly applies a transformation.
codeforces competitive-programming binary-search data-structures math sortings Jun 9, 2026
Practice › Codeforces Solutions › Codeforces Round 894 (Div. 3) ›

CF 1862D - Ice Cream Balls

We are asked to determine the minimum number of ice cream balls Tema needs to buy to make exactly n distinct two-ball ice cream cones. Each cone consists of two balls, which may be of the same flavor.
codeforces competitive-programming binary-search combinatorics constructive-algorithms math Jun 9, 2026
Practice › Codeforces Solutions › Codeforces Round 894 (Div. 3) ›

CF 1862B - Sequence Game

We are asked to reconstruct a possible original sequence a given a sequence b that was derived by a simple filtering rule. The sequence b always starts with the first element of a, and then includes every element of a that is greater than or equal to its immediate predecessor.
codeforces competitive-programming constructive-algorithms Jun 9, 2026
Practice › Codeforces Solutions › Codeforces Round 894 (Div. 3) ›

CF 1862A - Gift Carpet

We are given a rectangular carpet of size $n times m$ where each cell contains a lowercase letter. Vika likes to read her name "vika" from the carpet by selecting one letter from each column, moving strictly left to right, and choosing exactly four columns for the letters 'v'…
codeforces competitive-programming dp greedy implementation strings Jun 9, 2026
Practice › Codeforces Solutions › Codeforces Round 894 (Div. 3) ›

CF 1862F - Magic Will Save the World

We are asked to calculate the minimum time Vika, a sorceress, needs to defeat a sequence of monsters. Each monster has a strength, and Vika has two types of magic-water and fire. In one second, she generates fixed amounts of water and fire mana.
codeforces competitive-programming binary-search bitmasks brute-force dp Jun 9, 2026
Practice › Codeforces Solutions › Codeforces Round 894 (Div. 3) ›

CF 1862E - Kolya and Movie Theatre

Kolya wants to visit a movie theatre over n consecutive days, each day showing a new movie. Each movie has a raw entertainment value a[i], but the enjoyment Kolya actually gains is reduced by how long he has waited since his last visit.
codeforces competitive-programming constructive-algorithms data-structures greedy Jun 9, 2026
Practice › Codeforces Solutions › Codeforces Round 894 (Div. 3) ›

CF 1862C - Flower City Fence

We are given a sequence of fence planks, each with a height, already sorted in non-increasing order. Anya wants to know if the fence is symmetrical when viewed as a grid of unit blocks.
codeforces competitive-programming binary-search data-structures implementation sortings Jun 9, 2026