Codeforces Beta Round 6 (Div. 2 Only)

5 problems from Codeforces Beta Round 6 (Div. 2 Only) (contest 6), difficulty 900-2600. 5/5 solutions verified against sample I/O.

5 items

Codeforces Beta Round 6 (Div. 2 Only)

Div. 2 | 5 problems | 5/5 verified | Difficulty 900-2600 | 7m 21s

# Problem Rating Tags Accepted Time ✓
A Triangle 900 brute-force, geometry 22,839 1m 18s ✓
B President's Office 1100 implementation 14,823 1m 18s ✓
C Alice, Bob and Chocolate 1200 greedy, two-pointers 17,460 1m 29s ✓
D Lizards and Basements 2 2600 brute-force, dp 2,279 2m 18s ✓
E Exposition 1900 binary-search, data-structures, dsu 3,864 58s ✓
Practice › Codeforces Solutions › Codeforces Beta Round 6 (Div. 2 Only) ›

CF 6A - Triangle

We are given four stick lengths, and we must choose exactly three of them. Depending on the relationship between those three lengths, there are three possible outcomes.
codeforces competitive-programming brute-force geometry May 28, 2026
Practice › Codeforces Solutions › Codeforces Beta Round 6 (Div. 2 Only) ›

CF 6B - President's Office

The office is represented as a rectangular grid. Every uppercase letter represents part of a desk, and all cells with the same letter belong to the same rectangular desk. The president’s desk color is given as c.
codeforces competitive-programming implementation May 28, 2026
Practice › Codeforces Solutions › Codeforces Beta Round 6 (Div. 2 Only) ›

CF 6C - Alice, Bob and Chocolate

We have a row of chocolate bars, and each bar takes a certain amount of time to eat. Alice starts from the left end and keeps moving right. Bob starts from the right end and keeps moving left.
codeforces competitive-programming greedy two-pointers May 28, 2026
Practice › Codeforces Solutions › Codeforces Beta Round 6 (Div. 2 Only) ›

CF 6D - Lizards and Basements 2

We have a line of archers, each with some health. A fireball can only be thrown at positions 2 ... n-1. If we throw at position i, then:
codeforces competitive-programming brute-force dp May 28, 2026
Practice › Codeforces Solutions › Codeforces Beta Round 6 (Div. 2 Only) ›

CF 6E - Exposition

We are given a sequence of books by Berlbury, each with a known height, arranged chronologically. The library wants to organize an exposition by selecting consecutive books such that the difference between the tallest and shortest book in the selection does not exceed a given…
codeforces competitive-programming binary-search data-structures dsu trees two-pointers May 28, 2026