Codeforces Beta Round 94 (Div. 1 Only)

Solutions for Codeforces Beta Round 94 (Div. 1 Only) (contest 128). 5/5 problems verified against sample I/O. Difficulty range: 1500-2900.

5 items

Codeforces Beta Round 94 (Div. 1 Only)

Type: Div. 1 | Problems: 5 | Verified: 5/5 | Rating range: 1500-2900 | Time: 8m 36s

Problem Name Rating Tags Solve Time Verified
A Statues 1500 dfs-and-similar 2m 10s ✓
B String 2100 brute-force, constructive-algorithms, hashing 1m 21s ✓
C Games with Rectangle 2000 combinatorics, dp 1m 52s ✓
D Numbers 2000 constructive-algorithms, implementation 1m 38s ✓
E Birthday 2900 geometry, math 1m 35s ✓
Practice › Codeforces Solutions › Codeforces Beta Round 94 (Div. 1 Only) ›

CF 128A - Statues

We have an 8 × 8 board. Maria starts in the bottom-left corner, Anna stays permanently in the top-right corner, and several statues occupy other cells. The game proceeds in rounds. Maria moves first, then every statue moves one row downward simultaneously.
codeforces competitive-programming dfs-and-similar May 28, 2026
Practice › Codeforces Solutions › Codeforces Beta Round 94 (Div. 1 Only) ›

CF 128B - String

We are given a string of lowercase letters and an integer k. The task is to generate all possible substrings of the string, sort them lexicographically, and return the k-th substring in that order.
codeforces competitive-programming brute-force constructive-algorithms hashing implementation string-suffix-structures strings May 28, 2026
Practice › Codeforces Solutions › Codeforces Beta Round 94 (Div. 1 Only) ›

CF 128C - Games with Rectangle

We start with a rectangle drawn on grid paper. Only the border matters, not the interior. Players repeatedly draw a strictly smaller rectangle inside the previous one.
codeforces competitive-programming combinatorics dp May 28, 2026
Practice › Codeforces Solutions › Codeforces Beta Round 94 (Div. 1 Only) ›

CF 128D - Numbers

We are given a multiset of numbers and asked whether it is possible to arrange them in a circle so that every pair of adjacent numbers differs by exactly one. Conceptually, this means each number is a vertex on a cycle, and the absolute difference between neighbors must be 1.
codeforces competitive-programming constructive-algorithms implementation May 28, 2026
Practice › Codeforces Solutions › Codeforces Beta Round 94 (Div. 1 Only) ›

CF 128E - Birthday

We are asked to determine the maximum number of banana pieces Maria can produce from a birthday cake decorated with n non-overlapping circular banana pieces using exactly k straight-line cuts. Each circle has a center coordinate (x, y) and a radius r.
codeforces competitive-programming geometry math May 28, 2026