Codeforces Beta Round 48

Solutions for Codeforces Beta Round 48 (contest 51). 4/6 problems verified against sample I/O. Difficulty range: 1300-2800.

6 items

Codeforces Beta Round 48

Type: Beta | Problems: 6 | Verified: 4/6 | Rating range: 1300-2800 | Time: 13m 36s

Problem Name Rating Tags Solve Time Verified
A Cheaterius's Problem 1300 implementation 1m 37s ✓
B bHTML Tables Analisys 1700 expression-parsing 3m 37s ✓
C Three Base Stations 1800 binary-search, greedy 2m 13s ✗
D Geometrical problem 2200 implementation 1m 55s ✓
E Pentagon 2400 combinatorics, graphs, matrices 2m 2s ✗
F Caterpillar 2800 dfs-and-similar, dp, graphs 2m 12s ✓
Practice › Codeforces Solutions › Codeforces Beta Round 48 ›

Practice › Codeforces Solutions › Codeforces Beta Round 48 ›

CF 51A - Cheaterius's Problem

Each amulet is a 2 x 2 square filled with numbers from 1 to 6. We can think of it as four cells:
codeforces competitive-programming implementation May 28, 2026
Practice › Codeforces Solutions › Codeforces Beta Round 48 ›

CF 51B - bHTML Tables Analisys

We are given a string that represents a simplified HTML table language. The language contains only three kinds of tags: <table>, <tr>, and <td>, together with their matching closing tags.
codeforces competitive-programming expression-parsing May 28, 2026
Practice › Codeforces Solutions › Codeforces Beta Round 48 ›

CF 51C - Three Base Stations

We are given a village represented as points along a one-dimensional line, each point being a house coordinate. The task is to place exactly three cellular base stations along this line so that every house lies within the coverage of at least one station.
codeforces competitive-programming binary-search greedy May 28, 2026
Practice › Codeforces Solutions › Codeforces Beta Round 48 ›

CF 51D - Geometrical problem

We are given an integer array and must classify it into one of three categories.
codeforces competitive-programming implementation May 28, 2026
Practice › Codeforces Solutions › Codeforces Beta Round 48 ›

CF 51F - Caterpillar

We start with an undirected graph that may be disconnected and may contain cycles. We are allowed to repeatedly merge two vertices into one. Merging decreases the number of vertices by one, while the number of edges stays unchanged.
codeforces competitive-programming dfs-and-similar dp graphs trees May 28, 2026