Codeforces Round 888 (Div. 3)

Solutions for Codeforces Round 888 (Div. 3) (contest 1851). 1/6 problems verified against sample I/O. Difficulty range: 800-2000.

6 items

Codeforces Round 888 (Div. 3)

Type: Div. 3 | Problems: 6 | Verified: 1/6 | Rating range: 800-2000 | Time: 11m 5s

Problem Name Rating Tags Solve Time Verified
A Escalator Conversations 800 brute-force, constructive-algorithms, math 1m 18s ✓
B Parity Sort 800 greedy, sortings, two-pointers 1m 25s ✗
D Prefix Permutation Sums 1300 implementation, math 2m 15s ✗
E Nastya and Potions 1500 dfs-and-similar, dp, graphs 1m 37s ✗
F Lisa and the Martians 1800 bitmasks, greedy, math 3m 6s ✗
G Vlad and the Mountains 2000 binary-search, data-structures, dsu 1m 24s ✗
Practice › Codeforces Solutions › Codeforces Round 888 (Div. 3) ›

CF 1851F - Lisa and the Martians

We are asked to help Lisa maximize a bitwise expression using a sequence of numbers. She is given a list of n non-negative integers, each strictly less than 2^k.
codeforces competitive-programming bitmasks greedy math strings trees Jun 9, 2026
Practice › Codeforces Solutions › Codeforces Round 888 (Div. 3) ›

CF 1851G - Vlad and the Mountains

The problem describes a scenario where Vlad wants to traverse a set of mountains connected by roads. Each mountain has a height, and traveling from one mountain to another along a road either costs or restores energy, depending on the relative heights.
codeforces competitive-programming binary-search data-structures dsu graphs implementation sortings trees two-pointers Jun 9, 2026
Practice › Codeforces Solutions › Codeforces Round 888 (Div. 3) ›

CF 1851D - Prefix Permutation Sums

We are given a strictly increasing array of integers, which represents a prefix sum of some permutation of numbers from 1 to n, but one element of the original permutation has been lost.
codeforces competitive-programming implementation math Jun 9, 2026
Practice › Codeforces Solutions › Codeforces Round 888 (Div. 3) ›

CF 1851E - Nastya and Potions

We are given a collection of potions, each with a cost to buy, and a set of unlimited potions that Nastya already has. Some potions can be created by mixing other potions, which consumes the ingredients.
codeforces competitive-programming dfs-and-similar dp graphs sortings Jun 9, 2026
Practice › Codeforces Solutions › Codeforces Round 888 (Div. 3) ›

CF 1851B - Parity Sort

We are given an array of integers and allowed to repeatedly swap elements, but with a restriction: a swap is only valid if both elements have the same parity, meaning both are even or both are odd.
codeforces competitive-programming greedy sortings two-pointers Jun 9, 2026
Practice › Codeforces Solutions › Codeforces Round 888 (Div. 3) ›

CF 1851A - Escalator Conversations

We are given a fixed escalator structure and a set of people with known heights. Vlad also has a height. The escalator has equally spaced steps, and each step increases in height by a constant value.
codeforces competitive-programming brute-force constructive-algorithms math Jun 9, 2026