Codeforces Round 1084 (Div. 3)

8 problems from Codeforces Round 1084 (Div. 3) (contest 2200), difficulty 800-2600. 2/8 solutions verified against sample I/O.

8 items

Codeforces Round 1084 (Div. 3)

Div. 3 | 8 problems | 2/8 verified | Difficulty 800-2600 | 14m 57s

# Problem Rating Tags Accepted Time ✓
A Eating Game 800 greedy 28,042 1m 33s ✓
B Deletion Sort 800 bitmasks, brute-force, greedy 25,414 1m 32s
C Specialty String 900 brute-force, greedy, strings 21,666 1m 33s ✓
D Portal 1300 greedy, sortings 11,758 2m 1s
E Divisive Battle 1500 games, greedy, math 8,029 1m 41s
F Mooclear Reactor 2 1900 brute-force, data-structures, greedy 2,880 2m 16s
G Operation Permutation 2200 combinatorics, dp, math 1,024 2m 17s
H Six Seven 2600 divide-and-conquer, math, number-theory 454 2m 4s
Practice › Codeforces Solutions › Codeforces Round 1084 (Div. 3) ›

CF 2200H - Six Seven

We are given an array of positive integers, and we define a number as special if the power of 6 that divides it is strictly greater than the power of 7 that divides it.
codeforces competitive-programming divide-and-conquer math number-theory strings trees Jun 7, 2026
Practice › Codeforces Solutions › Codeforces Round 1084 (Div. 3) ›

CF 2200G - Operation Permutation

We are given a starting integer $x$ and a list of $n$ operations, each of which modifies $x$ by either addition, subtraction, multiplication, or division by a positive integer. The twist is that the operations are applied in a random order: all $n!
codeforces competitive-programming combinatorics dp math probabilities Jun 7, 2026
Practice › Codeforces Solutions › Codeforces Round 1084 (Div. 3) ›

CF 2200F - Mooclear Reactor 2

We are given a collection of particles, each with an energy value and a reactivity limit. A particle's reactivity determines the maximum number of other particles that can coexist with it in the reactor.
codeforces competitive-programming brute-force data-structures greedy implementation sortings Jun 7, 2026
Practice › Codeforces Solutions › Codeforces Round 1084 (Div. 3) ›

CF 2200D - Portal

We are given a permutation arranged on a line and two special cutting points, called portals. These portals divide the array into segments and define where elements can be extracted from and reinserted.
codeforces competitive-programming greedy sortings Jun 7, 2026
Practice › Codeforces Solutions › Codeforces Round 1084 (Div. 3) ›

CF 2200E - Divisive Battle

We are given an array of positive integers and two players who alternate turns, starting with Alice. The game evolves by either ending immediately if the current array is already non-decreasing, or by performing a single allowed operation on a chosen element.
codeforces competitive-programming games greedy math number-theory Jun 7, 2026
Practice › Codeforces Solutions › Codeforces Round 1084 (Div. 3) ›

CF 2200A - Eating Game

We are given a circular table with n players, each having a certain number of dishes they must eat. Players take turns sequentially around the table, and during a player’s turn, if they have any dishes left, they must eat exactly one.
codeforces competitive-programming greedy Jun 7, 2026
Practice › Codeforces Solutions › Codeforces Round 1084 (Div. 3) ›

CF 2200C - Specialty String

We are given a string consisting of lowercase letters, and the game involves repeatedly replacing pairs of equal letters with asterisks, provided that all characters between them have already become asterisks.
codeforces competitive-programming brute-force greedy strings Jun 7, 2026
Practice › Codeforces Solutions › Codeforces Round 1084 (Div. 3) ›

CF 2200B - Deletion Sort

We are given several independent test cases. In each one, we start with a short array of positive integers and repeatedly remove elements until the remaining array is sorted in non-decreasing order.
codeforces competitive-programming bitmasks brute-force greedy sortings Jun 7, 2026