Educational Codeforces Round 112 (Rated for Div. 2)

6 problems from Educational Codeforces Round 112 (Rated for Div. 2) (contest 1555), difficulty 900-2700. 4/6 solutions verified against sample I/O.

6 items

Educational Codeforces Round 112 (Rated for Div. 2)

Div. 2 | 6 problems | 4/6 verified | Difficulty 900-2700 | 17m 22s

# Problem Rating Tags Accepted Time ✓
A PizzaForces 900 brute-force, math 30,341 4m 18s
B Two Tables 1300 brute-force 17,245 4m 31s
C Coin Rows 1300 brute-force, constructive-algorithms, dp 24,076 2m 34s ✓
D Say No to Palindromes 1600 brute-force, constructive-algorithms, dp 15,465 3m 6s ✓
E Boring Segments 2100 data-structures, sortings, trees 4,525 1m 46s ✓
F Good Graph 2700 data-structures, dsu, graphs 1,049 1m 7s ✓
Practice › Codeforces Solutions › Educational Codeforces Round 112 (Rated for Div. 2) ›

CF 1555B - Two Tables

We are given a rectangular room and inside it a fixed axis-aligned rectangular table. The table currently occupies a block inside the room, but we are allowed to slide this table anywhere inside the room as long as it stays fully inside the boundary.
codeforces competitive-programming brute-force Jun 14, 2026
Practice › Codeforces Solutions › Educational Codeforces Round 112 (Rated for Div. 2) ›

CF 1555E - Boring Segments

We are given a set of weighted intervals on a number line from 1 to m. Each interval allows free movement between any two integer points inside it, which effectively means that once we pick a set of intervals, all points covered by overlapping intervals become connected…
codeforces competitive-programming data-structures sortings trees two-pointers Jun 14, 2026
Practice › Codeforces Solutions › Educational Codeforces Round 112 (Rated for Div. 2) ›

CF 1555A - PizzaForces

We are asked to build an order of pizzas where each pizza contributes both a fixed number of slices and a fixed baking time.
codeforces competitive-programming brute-force math Jun 14, 2026
Practice › Codeforces Solutions › Educational Codeforces Round 112 (Rated for Div. 2) ›

CF 1555D - Say No to Palindromes

We are given a string made only of three possible letters. For any substring, we are allowed to change characters, and each change replaces a character with any of the three letters.
codeforces competitive-programming brute-force constructive-algorithms dp strings Jun 14, 2026
Practice › Codeforces Solutions › Educational Codeforces Round 112 (Rated for Div. 2) ›

CF 1555F - Good Graph

We are maintaining an undirected graph that grows edge by edge. Every edge has a binary weight, either 0 or 1. After each insertion request, we must decide whether adding that edge keeps a certain global property valid.
codeforces competitive-programming data-structures dsu graphs trees Jun 10, 2026
Practice › Codeforces Solutions › Educational Codeforces Round 112 (Rated for Div. 2) ›

CF 1555C - Coin Rows

We are given a 2-row grid of coins with m columns. Alice and Bob both start at the top-left corner (1,1) and want to reach the bottom-right (2,m) using only moves to the right or down. Alice moves first and collects all coins along her path.
codeforces competitive-programming brute-force constructive-algorithms dp implementation Jun 10, 2026