Codeforces Beta Round 14 (Div. 2)

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

5 items

Codeforces Beta Round 14 (Div. 2)

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

Problem Name Rating Tags Solve Time Verified
A Letter 800 implementation 1m 8s ✓
B Young Photographer 1000 implementation 1m 20s ✓
C Four Segments 1700 brute-force, constructive-algorithms, geometry 1m 48s ✓
D Two Paths 1900 dfs-and-similar, dp, graphs 1m 27s ✓
E Camels 1900 dp 1m 59s ✓
Practice › Codeforces Solutions › Codeforces Beta Round 14 (Div. 2) ›

CF 14A - Letter

We are given a rectangular grid representing a sheet of graph paper with _n_ rows and _m_ columns. Some of the squares are shaded, marked by *, and the rest are unshaded, marked by ..
codeforces competitive-programming implementation May 28, 2026
Practice › Codeforces Solutions › Codeforces Beta Round 14 (Div. 2) ›

CF 14B - Young Photographer

The problem asks us to determine how far Bob, a photographer, must move along a straight racetrack to take pictures of every sportsman. Each sportsman runs back and forth along a fixed segment of the racetrack, defined by two positions ai and bi.
codeforces competitive-programming implementation May 28, 2026
Practice › Codeforces Solutions › Codeforces Beta Round 14 (Div. 2) ›

CF 14C - Four Segments

We are given exactly four line segments on the 2D plane. Every segment is axis-aligned, or may even degenerate into a single point.
codeforces competitive-programming brute-force constructive-algorithms geometry implementation math May 28, 2026
Practice › Codeforces Solutions › Codeforces Beta Round 14 (Div. 2) ›

CF 14D - Two Paths

We are given a tree of n cities, meaning each city is connected in such a way that there is exactly one simple path between any two cities. Roads are undirected, and each road has a length of 1.
codeforces competitive-programming dfs-and-similar dp graphs shortest-paths trees two-pointers May 28, 2026
Practice › Codeforces Solutions › Codeforces Beta Round 14 (Div. 2) ›

CF 14E - Camels

We are counting sequences of heights that describe a polyline. The x-coordinates are fixed as 1, 2, ..., n, so the whole shape is determined only by the sequence y1, y2, ..., yn.
codeforces competitive-programming dp May 28, 2026