Codeforces Beta Round 34 (Div. 2)

Solutions for Codeforces Beta Round 34 (Div. 2) (contest 34). 5/5 problems verified against sample I/O. Difficulty range: 800-2000.

5 items

Codeforces Beta Round 34 (Div. 2)

Type: Div. 2 | Problems: 5 | Verified: 5/5 | Rating range: 800-2000 | Time: 7m 19s

Problem Name Rating Tags Solve Time Verified
A Reconnaissance 2 800 implementation 1m 18s ✓
B Sale 900 greedy, sortings 1m 19s ✓
C Page Numbers 1300 expression-parsing, implementation, sortings 1m 7s ✓
D Road Map 1600 dfs-and-similar, graphs 1m 29s ✓
E Collisions 2000 brute-force, implementation, math 2m 6s ✓
Practice › Codeforces Solutions › Codeforces Beta Round 34 (Div. 2) ›

CF 34A - Reconnaissance 2

We are given the heights of soldiers standing in a circle. Two soldiers can form a reconnaissance unit if they stand next to each other and their height difference is as small as possible among all neighboring pairs.
codeforces competitive-programming implementation May 28, 2026
Practice › Codeforces Solutions › Codeforces Beta Round 34 (Div. 2) ›

CF 34B - Sale

Bob is at a sale with a collection of old TVs, each with a price. Some TVs are free, some have positive prices, and some even have negative prices, which means the owner is willing to pay Bob to take them away.
codeforces competitive-programming greedy sortings May 28, 2026
Practice › Codeforces Solutions › Codeforces Beta Round 34 (Div. 2) ›

CF 34C - Page Numbers

We are asked to process a user-entered sequence of page numbers for printing. The input is a single string of positive integers separated by commas, such as 1,2,3,1,1,2,6,6,2. Some numbers may repeat, possibly non-consecutively.
codeforces competitive-programming expression-parsing implementation sortings strings May 28, 2026
Practice › Codeforces Solutions › Codeforces Beta Round 34 (Div. 2) ›

CF 34D - Road Map

We are given a tree with n cities. Originally, city r1 is considered the capital, and for every other city we know its parent in the rooted tree. The value p[i] means that if we walk from the old capital toward city i, the last city before reaching i is p[i].
codeforces competitive-programming dfs-and-similar graphs May 28, 2026
Practice › Codeforces Solutions › Codeforces Beta Round 34 (Div. 2) ›

CF 34E - Collisions

We have several point-like balls moving on a one-dimensional line. Every ball starts at some coordinate with its own velocity and mass.
codeforces competitive-programming brute-force implementation math May 28, 2026