Codeforces Beta Round 22 (Div. 2 Only)

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

5 items

Codeforces Beta Round 22 (Div. 2 Only)

Type: Div. 2 | Problems: 5 | Verified: 4/5 | Rating range: 800-2300 | Time: 7m 39s

Problem Name Rating Tags Solve Time Verified
A Second Order Statistics 800 brute-force 1m 21s ✓
B Bargaining Table 1500 brute-force, dp 1m 40s ✓
C System Administrator 1700 graphs 1m 25s ✗
D Segments 1900 greedy, sortings 1m 25s ✓
E Scheme 2300 dfs-and-similar, graphs, trees 1m 48s ✓
Practice › Codeforces Solutions › Codeforces Beta Round 22 (Div. 2 Only) ›

CF 22A - Second Order Statistics

We are given a small array of integers and need to find the smallest value that is strictly larger than the minimum element in the array.
codeforces competitive-programming brute-force May 28, 2026
Practice › Codeforces Solutions › Codeforces Beta Round 22 (Div. 2 Only) ›

CF 22B - Bargaining Table

The office floor is represented as an n × m grid. Each cell is either free, written as 0, or blocked by furniture, written as 1. We want to place one rectangular table whose sides stay aligned with the grid. Every cell covered by the rectangle must be free.
codeforces competitive-programming brute-force dp May 28, 2026
Practice › Codeforces Solutions › Codeforces Beta Round 22 (Div. 2 Only) ›

CF 22C - System Administrator

We are asked to design a network of servers where each server is a node, and each connection between two servers is an undirected edge. There are n servers and we are allowed exactly m connections.
codeforces competitive-programming graphs May 28, 2026
Practice › Codeforces Solutions › Codeforces Beta Round 22 (Div. 2 Only) ›

CF 22D - Segments

We are given several closed intervals on the number line. A nail placed at an integer coordinate covers every segment that contains that coordinate, including endpoints.
codeforces competitive-programming greedy sortings May 28, 2026
Practice › Codeforces Solutions › Codeforces Beta Round 22 (Div. 2 Only) ›

CF 22E - Scheme

Each person points to exactly one other person. If someone learns the news, they call the person they point to, who then calls the next person, and so on. We may add extra directed edges of the form x -> y, meaning person x must also call y.
codeforces competitive-programming dfs-and-similar graphs trees May 28, 2026