Codeforces Round 882 (Div. 2)

Solutions for Codeforces Round 882 (Div. 2) (contest 1847). 4/6 problems verified against sample I/O. Difficulty range: 800-2900.

6 items

Codeforces Round 882 (Div. 2)

Type: Div. 2 | Problems: 6 | Verified: 4/6 | Rating range: 800-2900 | Time: 13m 4s

Problem Name Rating Tags Solve Time Verified
A The Man who became a God 800 greedy, sortings 1m 21s ✓
B Hamon Odyssey 1000 bitmasks, greedy, two-pointers 1m 23s ✓
C Vampiric Powers, anyone? 1400 bitmasks, brute-force, dp 6m 27s ✗
D Professor Higashikata 1900 data-structures, dsu, greedy 1m 18s ✓
E Triangle Platinum? 2900 brute-force, combinatorics, implementation 1m 20s ✗
F The Boss's Identity 2500 binary-search, bitmasks, data-structures 1m 15s ✓
Practice › Codeforces Solutions › Codeforces Round 882 (Div. 2) ›

CF 1847C - Vampiric Powers, anyone?

We are given an array of small integers, and we are allowed to repeatedly extend it. Each extension picks a suffix starting at some position and appends its XOR to the end of the array.
codeforces competitive-programming bitmasks brute-force dp greedy Jun 9, 2026
Practice › Codeforces Solutions › Codeforces Round 882 (Div. 2) ›

CF 1847F - The Boss's Identity

We are given a sequence that starts with a finite prefix of length $n$. After that point, the sequence does not stop; instead, every new element is formed by combining the previous $n$ elements using bitwise OR between two adjacent shifted values.
codeforces competitive-programming binary-search bitmasks data-structures dfs-and-similar greedy math sortings Jun 9, 2026
Practice › Codeforces Solutions › Codeforces Round 882 (Div. 2) ›

CF 1847E - Triangle Platinum?

We are given an array of $n$ hidden integers, each between $1$ and $4$. We cannot see these numbers directly, but we can ask queries about triples of indices. Each query returns a number related to the area of a triangle formed by the three values at those indices.
codeforces competitive-programming brute-force combinatorics implementation interactive math probabilities Jun 9, 2026
Practice › Codeforces Solutions › Codeforces Round 882 (Div. 2) ›

CF 1847D - Professor Higashikata

We are given a binary string s and a fixed collection of intervals over it. Each interval extracts a substring, and all extracted substrings are concatenated in order to form a new string t(s).
codeforces competitive-programming data-structures dsu greedy implementation strings Jun 9, 2026
Practice › Codeforces Solutions › Codeforces Round 882 (Div. 2) ›

CF 1847B - Hamon Odyssey

We are given several independent test cases. In each test case, we start with an array of integers, and we are allowed to split this array into contiguous segments. Every element must belong to exactly one segment.
codeforces competitive-programming bitmasks greedy two-pointers Jun 9, 2026
Practice › Codeforces Solutions › Codeforces Round 882 (Div. 2) ›

CF 1847A - The Man who became a God

The problem asks us to split a sequence of villagers, each with a numerical suspicion level, into exactly k contiguous groups in a way that minimizes the total "power" of these groups.
codeforces competitive-programming greedy sortings Jun 9, 2026