Codeforces Beta Round 94 (Div. 1 Only)

5 problems from Codeforces Beta Round 94 (Div. 1 Only) (contest 128), difficulty 1500-2900. 5/5 solutions verified against sample I/O.

5 items

Codeforces Beta Round 94 (Div. 1 Only)

Div. 1 | 5 problems | 5/5 verified | Difficulty 1500-2900 | 8m 36s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Statues	1500	dfs-and-similar	3,508	2m 10s	✓
B	String	2100	brute-force, constructive-algorithms, hashing	2,869	1m 21s	✓
C	Games with Rectangle	2000	combinatorics, dp	3,244	1m 52s	✓
D	Numbers	2000	constructive-algorithms, implementation	1,261	1m 38s	✓
E	Birthday	2900	geometry, math	113	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.

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.

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.

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.

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.