Codeforces Beta Round 58

Solutions for Codeforces Beta Round 58 (contest 62). 4/5 problems verified against sample I/O. Difficulty range: 1300-2700.

5 items

Codeforces Beta Round 58

Type: Beta | Problems: 5 | Verified: 4/5 | Rating range: 1300-2700 | Time: 8m 15s

Problem Name Rating Tags Solve Time Verified
A A Student's Dream 1300 greedy, math 1m 13s ✓
B Tyndex.Brome 1800 binary-search, implementation 1m 18s ✓
C Inquisition 2300 geometry, implementation, sortings 1m 32s ✓
D Wormhouse 2300 dfs-and-similar, graphs 2m 15s ✗
E World Evil 2700 dp, flows 1m 57s ✓
Practice › Codeforces Solutions › Codeforces Beta Round 58 ›

CF 62A - A Student's Dream

We have four integers describing the number of fingers on two alien hands. The Venusian girl has al fingers on her left hand and ar on her right hand. The Marsian boy has bl and br fingers. They want to hold exactly one pair of hands.
codeforces competitive-programming greedy math May 28, 2026
Practice › Codeforces Solutions › Codeforces Beta Round 58 ›

CF 62B - Tyndex.Brome

The task is to compute a kind of "distance" between a user-entered address and a list of potential addresses, according to a specific error function. The user enters a string s of length k. Then there are n potential addresses, each a string of arbitrary length.
codeforces competitive-programming binary-search implementation May 28, 2026
Practice › Codeforces Solutions › Codeforces Beta Round 58 ›

CF 62C - Inquisition

We are given up to 100 triangles on the plane. Each triangle represents a black spot on a white square. Triangles may overlap, intersect, or even completely cover one another. The task is to compute the perimeter of the union of all black regions.
codeforces competitive-programming geometry implementation sortings May 28, 2026
Practice › Codeforces Solutions › Codeforces Beta Round 58 ›

CF 62D - Wormhouse

We are given a connected graph representing rooms in Arnie’s apple house. Each room is a node, corridors between rooms are edges, and the graph has no self-loops or multiple edges between the same pair of rooms.
codeforces competitive-programming dfs-and-similar graphs May 28, 2026
Practice › Codeforces Solutions › Codeforces Beta Round 58 ›

CF 62E - World Evil

We are asked to compute the maximum number of “tentacles” that can traverse a cylindrical grid from the leftmost column to the rightmost column, given capacities for every corridor connecting adjacent cells.
codeforces competitive-programming dp flows May 28, 2026