Educational Codeforces Round 162 (Rated for Div. 2)

Solutions for Educational Codeforces Round 162 (Rated for Div. 2) (contest 1923). 2/6 problems verified against sample I/O. Difficulty range: 800-2800.

6 items

Educational Codeforces Round 162 (Rated for Div. 2)

Type: Div. 2 | Problems: 6 | Verified: 2/6 | Rating range: 800-2800 | Time: 10m 9s

Problem Name Rating Tags Solve Time Verified
A Moving Chips 800 greedy, implementation 1m 52s ✗
B Monsters Attack! 1100 dp, greedy, implementation 1m 37s ✓
C Find B 1400 constructive-algorithms, greedy 1m 43s ✓
D Slimes 1800 binary-search, constructive-algorithms, data-structures 2m 8s ✗
E Count Paths 2000 data-structures, dfs-and-similar, dp 2m 6s ✗
F Shrink-Reverse 2800 binary-search, brute-force, greedy 43s ✗
Practice › Codeforces Solutions › Educational Codeforces Round 162 (Rated for Div. 2) ›

CF 1923E - Count Paths

We are given a tree with n nodes, each colored with some integer between 1 and n. The task is to count the number of simple paths of length at least two such that the first and last nodes have the same color, and no intermediate node shares this color.
codeforces competitive-programming data-structures dfs-and-similar dp dsu graphs trees Jun 8, 2026
Practice › Codeforces Solutions › Educational Codeforces Round 162 (Rated for Div. 2) ›

CF 1923D - Slimes

We are given a row of slimes, each with a positive size. The slimes interact in a simple but constrained way: a slime can eat an adjacent slime if it is strictly larger, and upon eating, it grows by the eaten slime’s size.
codeforces competitive-programming binary-search constructive-algorithms data-structures greedy two-pointers Jun 8, 2026
Practice › Codeforces Solutions › Educational Codeforces Round 162 (Rated for Div. 2) ›

CF 1923F - Shrink-Reverse

We are given a binary string s of length n and a number k representing the maximum number of allowed operations. Each operation can either swap two characters of the string or remove all leading zeros and then reverse the string.
codeforces competitive-programming binary-search brute-force greedy hashing implementation string-suffix-structures strings Jun 8, 2026
Practice › Codeforces Solutions › Educational Codeforces Round 162 (Rated for Div. 2) ›

CF 1923A - Moving Chips

We are given a row of cells, each either containing a chip or empty. The goal is to move chips leftward into contiguous groups by repeatedly picking a chip and moving it into the closest empty cell to its left.
codeforces competitive-programming greedy implementation Jun 8, 2026
Practice › Codeforces Solutions › Educational Codeforces Round 162 (Rated for Div. 2) ›

CF 1923C - Find B

We are given an array c of positive integers and multiple queries asking whether certain subarrays of c are good.
codeforces competitive-programming constructive-algorithms greedy Jun 8, 2026
Practice › Codeforces Solutions › Educational Codeforces Round 162 (Rated for Div. 2) ›

CF 1923B - Monsters Attack!

We have a line with our character at position 0 and monsters positioned at some coordinates $xi$, each with health $ai$. Every second, we can fire up to $k$ bullets, reducing the health of monsters we choose.
codeforces competitive-programming dp greedy implementation Jun 8, 2026