Codeforces Round 887 (Div. 1)

Solutions for Codeforces Round 887 (Div. 1) (contest 1852). 0/6 problems verified against sample I/O. Difficulty range: 1800-3500.

6 items

Codeforces Round 887 (Div. 1)

Type: Div. 1 | Problems: 6 | Verified: 0/6 | Rating range: 1800-3500 | Time: 9m 31s

Problem Name Rating Tags Solve Time Verified
A Ntarsis' Set 1800 binary-search, math, number-theory 1m 23s ✗
B Imbalanced Arrays 1800 constructive-algorithms, graphs, greedy 2m 24s ✗
C Ina of the Mountain 2400 data-structures, dp, greedy 2m 13s ✗
D Miriany and Matchstick 2800 constructive-algorithms, dp, greedy 1m 39s ✗
E Rivalries 3400 constructive-algorithms, data-structures, greedy 1m 20s ✗
F Panda Meetups 3500 data-structures, dp, flows 32s ✗
Practice › Codeforces Solutions › Codeforces Round 887 (Div. 1) ›

CF 1852E - Rivalries

We are given an array $a$. From this array, we are asked to construct another array $b$ of the same length, consisting of positive integers, but not arbitrary ones.
codeforces competitive-programming constructive-algorithms data-structures greedy Jun 9, 2026
Practice › Codeforces Solutions › Codeforces Round 887 (Div. 1) ›

CF 1852D - Miriany and Matchstick

We are given a grid with two rows and $n$ columns. The entire first row is already fixed as a string consisting of A and B. The second row is completely free to choose, but must also be filled with A and B. Once both rows are filled, we look at adjacency in the grid.
codeforces competitive-programming constructive-algorithms dp greedy Jun 9, 2026
Practice › Codeforces Solutions › Codeforces Round 887 (Div. 1) ›

CF 1852F - Panda Meetups

Codeforces 1852F: Panda Meetups
codeforces competitive-programming data-structures dp flows Jun 9, 2026
Practice › Codeforces Solutions › Codeforces Round 887 (Div. 1) ›

CF 1852B - Imbalanced Arrays

Working
codeforces competitive-programming constructive-algorithms graphs greedy math sortings two-pointers Jun 9, 2026
Practice › Codeforces Solutions › Codeforces Round 887 (Div. 1) ›

CF 1852C - Ina of the Mountain

We start with an infinite sorted sequence of positive integers. Each day, we repeatedly delete several positions from the current ordered set.
codeforces competitive-programming data-structures dp greedy math Jun 9, 2026
Practice › Codeforces Solutions › Codeforces Round 887 (Div. 1) ›

CF 1852A - Ntarsis' Set

We are given an initially infinite-like set $S$ consisting of integers $1, 2, 3, dots$. Each day, Ntarsis removes specific elements from this set.
codeforces competitive-programming binary-search math number-theory Jun 9, 2026