Educational Codeforces Round 179 (Rated for Div. 2)

7 problems from Educational Codeforces Round 179 (Rated for Div. 2) (contest 2111), difficulty 800-2900. 3/7 solutions verified against sample I/O.

7 items

Educational Codeforces Round 179 (Rated for Div. 2)

Div. 2 | 7 problems | 3/7 verified | Difficulty 800-2900 | 11m 24s

# Problem Rating Tags Accepted Time ✓
A Energy Crystals 800 greedy, implementation, math 20,723 1m 40s
B Fibonacci Cubes 1100 brute-force, dp, implementation 17,881 1m 49s
C Equal Values 1100 brute-force, greedy, two-pointers 19,429 1m 18s ✓
D Creating a Schedule 1400 constructive-algorithms, data-structures, greedy 11,986 1m 40s
E Changing the String 1900 binary-search, data-structures, greedy 5,405 1m 36s
F Puzzle 2400 brute-force, constructive-algorithms, greedy 1,425 1m 43s ✓
G Divisible Subarrays 2900 binary-search, bitmasks, brute-force 398 1m 38s ✓
Practice › Codeforces Solutions › Educational Codeforces Round 179 (Rated for Div. 2) ›

CF 2111G - Divisible Subarrays

We are given a permutation of the numbers from 1 to n. For every query, we take a contiguous segment of this permutation and must decide whether that segment has a very specific structural property: whether there exists a way to split the segment into two parts using a…
codeforces competitive-programming binary-search bitmasks brute-force data-structures interactive Jun 8, 2026
Practice › Codeforces Solutions › Educational Codeforces Round 179 (Rated for Div. 2) ›

CF 2111F - Puzzle

We are asked to construct a shape made from unit square tiles placed on the integer grid. Each tile occupies one cell, and all chosen cells must form a single 4-connected component, meaning you can walk between any two tiles by stepping across shared edges.
codeforces competitive-programming brute-force constructive-algorithms greedy math Jun 8, 2026
Practice › Codeforces Solutions › Educational Codeforces Round 179 (Rated for Div. 2) ›

CF 2111E - Changing the String

We are given a string consisting only of the characters a, b, and c. Alongside it is a sequence of operations. Each operation suggests a possible replacement: choose any occurrence of a letter x and turn it into another letter y, or skip the operation entirely.
codeforces competitive-programming binary-search data-structures greedy implementation sortings strings Jun 8, 2026
Practice › Codeforces Solutions › Educational Codeforces Round 179 (Rated for Div. 2) ›

CF 2111D - Creating a Schedule

We are tasked with creating a class schedule for a faculty where each group has exactly six classes on the first day. There are $n$ student groups and $m$ classrooms.
codeforces competitive-programming constructive-algorithms data-structures greedy implementation sortings Jun 8, 2026
Practice › Codeforces Solutions › Educational Codeforces Round 179 (Rated for Div. 2) ›

CF 2111B - Fibonacci Cubes

We have a collection of cubes, where the side length of the $i$-th cube corresponds to the $i$-th Fibonacci number under a modified definition: $f1 = 1$, $f2 = 2$, and $fi = f{i-1} + f{i-2}$ for $i 2$.
codeforces competitive-programming brute-force dp implementation math Jun 8, 2026
Practice › Codeforces Solutions › Educational Codeforces Round 179 (Rated for Div. 2) ›

CF 2111A - Energy Crystals

We are working with three identical storage units that start at zero energy. The goal is to bring all three to exactly the same target level $x$. The only operation allowed is to pick one unit and increase its value by any positive integer.
codeforces competitive-programming greedy implementation math Jun 8, 2026
Practice › Codeforces Solutions › Educational Codeforces Round 179 (Rated for Div. 2) ›

CF 2111C - Equal Values

We are given an array of integers and allowed to repeatedly “broadcast” a chosen element’s value either to everything on its left or everything on its right.
codeforces competitive-programming brute-force greedy two-pointers Jun 8, 2026