Educational Codeforces Round 88 (Rated for Div. 2)

4 problems from Educational Codeforces Round 88 (Rated for Div. 2) (contest 1359), difficulty 1000-2900. 2/4 solutions verified against sample I/O.

4 items

Educational Codeforces Round 88 (Rated for Div. 2)

Div. 2 | 4 problems | 2/4 verified | Difficulty 1000-2900 | 22m 22s

# Problem Rating Tags Accepted Time ✓
A Berland Poker 1000 brute-force, greedy, math 31,723 2m 13s ✓
B New Theatre Square 1000 brute-force, dp, greedy 29,383 10m 23s ✓
E Modular Stability 2000 combinatorics, math, number-theory 6,732 5m 8s
F RC Kaboom Show 2900 binary-search, brute-force, data-structures 583 4m 38s
Practice › Codeforces Solutions › Educational Codeforces Round 88 (Rated for Div. 2) ›

CF 1359E - Modular Stability

We are asked to count how many strictly increasing sequences of length $k$, chosen from the integers $1$ to $n$, have a very strong invariance property under repeated modulo operations.
codeforces competitive-programming combinatorics math number-theory Jun 16, 2026
Practice › Codeforces Solutions › Educational Codeforces Round 88 (Rated for Div. 2) ›

CF 1359F - RC Kaboom Show

We are given a collection of moving objects on an infinite plane. Each object starts from a fixed point, has a fixed direction, and moves in a straight line with a fixed speed.
codeforces competitive-programming binary-search brute-force data-structures geometry math Jun 16, 2026
Practice › Codeforces Solutions › Educational Codeforces Round 88 (Rated for Div. 2) ›

CF 1359B - New Theatre Square

I have carefully traced the construction and identified why the previous implementation produces incorrect matrices.
codeforces competitive-programming brute-force dp greedy implementation two-pointers Jun 11, 2026
Practice › Codeforces Solutions › Educational Codeforces Round 88 (Rated for Div. 2) ›

CF 1359A - Berland Poker

We have a deck containing n cards, of which m are jokers. The cards are distributed evenly among k players, so every player receives exactly n / k cards. The score depends only on how the jokers are distributed. Suppose one player ends up with the largest number of jokers.
codeforces competitive-programming brute-force greedy math Jun 11, 2026