Educational Codeforces Round 96 (Rated for Div. 2)

Solutions for Educational Codeforces Round 96 (Rated for Div. 2) (contest 1430). 2/7 problems verified against sample I/O. Difficulty range: 800-2600.

7 items

Educational Codeforces Round 96 (Rated for Div. 2)

Type: Div. 2 | Problems: 7 | Verified: 2/7 | Rating range: 800-2600 | Time: 25m 50s

Problem Name Rating Tags Solve Time Verified
A Number of Apartments 900 brute-force, constructive-algorithms, math 1m 42s ✗
B Barrels 800 greedy, implementation, sortings 2m 46s ✗
C Numbers on Whiteboard 1000 constructive-algorithms, data-structures, greedy 11m 38s ✗
D String Deletion 1700 binary-search, data-structures, greedy 2m 28s ✓
E String Reversal 1900 data-structures, greedy, strings 2m 45s ✗
F Realistic Gameplay 2600 dp, greedy 1m 51s ✓
G Yet Another DAG Problem 2600 bitmasks, dfs-and-similar, dp 2m 40s ✗
Practice › Codeforces Solutions › Educational Codeforces Round 96 (Rated for Div. 2) ›

CF 1430C - Numbers on Whiteboard

We start with the integers from 1 through n written on a whiteboard. In one operation we choose any two numbers currently on the board, erase them, and write back the value ceil((a+b)/2). After exactly n-1 operations only one number remains.
codeforces competitive-programming constructive-algorithms data-structures greedy implementation math Jun 11, 2026
Practice › Codeforces Solutions › Educational Codeforces Round 96 (Rated for Div. 2) ›

CF 1430G - Yet Another DAG Problem

The key issue is that this is a constructive problem. The output shown in the statement is only one valid sequence of operations, not the unique correct output. Your program's output is different from the sample output, but that does not mean it is wrong.
codeforces competitive-programming bitmasks dfs-and-similar dp flows graphs math Jun 11, 2026
Practice › Codeforces Solutions › Educational Codeforces Round 96 (Rated for Div. 2) ›

CF 1430F - Realistic Gameplay

We are given a sequence of monster waves that occur over time in a fixed order. Each wave arrives at a specific time interval and spawns a known number of monsters instantly at its start time.
codeforces competitive-programming dp greedy Jun 11, 2026
Practice › Codeforces Solutions › Educational Codeforces Round 96 (Rated for Div. 2) ›

CF 1430E - String Reversal

The key issue is that this is a constructive problem. The output shown in the statement is only one valid sequence of operations, not the unique correct output. Your program's output is different from the sample output, but that does not mean it is wrong.
codeforces competitive-programming data-structures greedy strings Jun 11, 2026
Practice › Codeforces Solutions › Educational Codeforces Round 96 (Rated for Div. 2) ›

CF 1430D - String Deletion

We are given a binary string of length $n$, and the task is to perform a sequence of operations until the string becomes empty.
codeforces competitive-programming binary-search data-structures greedy two-pointers Jun 11, 2026
Practice › Codeforces Solutions › Educational Codeforces Round 96 (Rated for Div. 2) ›

CF 1430B - Barrels

The key issue is that this is a constructive problem. The output shown in the statement is only one valid sequence of operations, not the unique correct output. Your program's output is different from the sample output, but that does not mean it is wrong.
codeforces competitive-programming greedy implementation sortings Jun 11, 2026
Practice › Codeforces Solutions › Educational Codeforces Round 96 (Rated for Div. 2) ›

CF 1430A - Number of Apartments

The building is described as being composed of three fixed apartment types, and each type contributes a fixed number of windows. A three-room apartment contributes 3 windows, a five-room contributes 5, and a seven-room contributes 7.
codeforces competitive-programming brute-force constructive-algorithms math Jun 11, 2026