Codeforces Beta Round 66

Solutions for Codeforces Beta Round 66 (contest 73). 6/6 problems verified against sample I/O. Difficulty range: 1600-2900.

6 items

Codeforces Beta Round 66

Type: Beta | Problems: 6 | Verified: 6/6 | Rating range: 1600-2900 | Time: 12m 59s

Problem Name Rating Tags Solve Time Verified
A The Elder Trolls IV: Oblivon 1600 greedy, math 1m 48s ✓
B Need For Brake 2000 binary-search, greedy, sortings 2m 9s ✓
C LionAge II 1800 dp 1m 27s ✓
D FreeDiv 2200 dfs-and-similar, graphs, greedy 2m 38s ✓
E Morrowindows 2400 math, number-theory 1m 51s ✓
F Plane of Tanks 2900 brute-force, geometry 3m 6s ✓
Practice › Codeforces Solutions › Codeforces Beta Round 66 ›

CF 73A - The Elder Trolls IV: Oblivon

We have a rectangular block made of unit cubes with dimensions x × y × z. A single cut is always made along the grid lines and must be parallel to one of the faces of the box.
codeforces competitive-programming greedy math May 28, 2026
Practice › Codeforces Solutions › Codeforces Beta Round 66 ›

CF 73B - Need For Brake

We know the current championship standings before the final race. Every racer already has some number of points, and the last race distributes additional points to the top m finishers.
codeforces competitive-programming binary-search greedy sortings May 28, 2026
Practice › Codeforces Solutions › Codeforces Beta Round 66 ›

CF 73C - LionAge II

We are given a string representing a character's name in a game, and we can change at most k of its letters to maximize a score called euphony. The euphony is computed as the sum of bonuses for every consecutive pair of letters in the string.
codeforces competitive-programming dp May 28, 2026
Practice › Codeforces Solutions › Codeforces Beta Round 66 ›

CF 73D - FreeDiv

We are given an undirected graph where cities are vertices and roads are edges. Each connected component of the graph is called a province. Vasya may additionally build tunnels between cities, but tunnels have two restrictions.
codeforces competitive-programming dfs-and-similar graphs greedy May 28, 2026
Practice › Codeforces Solutions › Codeforces Beta Round 66 ›

CF 73E - Morrowindows

Each viewing mode groups the inventory into pages of size ai. If the inventory contains k items, then the game shows $bi = leftlceil frac{k}{ai} rightrceil$ pages in that mode. Vasya does not know the actual value of k, only that 2 ≤ k ≤ x.
codeforces competitive-programming math number-theory May 28, 2026
Practice › Codeforces Solutions › Codeforces Beta Round 66 ›

CF 73F - Plane of Tanks

We have a tank that wants to move from point A to point B along the straight segment connecting them. The tank moves with constant speed $v$, which we must choose as small as possible. There are $n$ enemy tanks placed on the plane.
codeforces competitive-programming brute-force geometry May 28, 2026