Codeforces Beta Round 29 (Div. 2, Codeforces format)

Solutions for Codeforces Beta Round 29 (Div. 2, Codeforces format) (contest 29). 3/5 problems verified against sample I/O. Difficulty range: 1000-2400.

5 items

Codeforces Beta Round 29 (Div. 2, Codeforces format)

Type: Div. 2 | Problems: 5 | Verified: 3/5 | Rating range: 1000-2400 | Time: 6m 47s

Problem Name Rating Tags Solve Time Verified
A Spit Problem 1000 brute-force 1m 12s ✓
B Traffic Lights 1500 implementation 1m 23s ✓
C Mail Stamps 1700 data-structures, dfs-and-similar, graphs 1m 37s ✗
D Ant on the Tree 2000 constructive-algorithms, dfs-and-similar, trees 1m 19s ✓
E Quarrel 2400 graphs, shortest-paths 1m 16s ✗
Practice › Codeforces Solutions › Codeforces Beta Round 29 (Div. 2, Codeforces format) ›

CF 29A - Spit Problem

Each camel stands at a unique coordinate on a number line. A camel at position x spits exactly toward position x + d. If another camel stands there, it gets hit. We need to determine whether there exists a pair of camels such that each one hits the other.
codeforces competitive-programming brute-force May 28, 2026
Practice › Codeforces Solutions › Codeforces Beta Round 29 (Div. 2, Codeforces format) ›

CF 29B - Traffic Lights

A car starts at point A and moves along a straight road toward point B. The total distance is l meters, and the car always moves at a fixed speed v. Somewhere along the road, exactly d meters from the start, there is a traffic light.
codeforces competitive-programming implementation May 28, 2026
Practice › Codeforces Solutions › Codeforces Beta Round 29 (Div. 2, Codeforces format) ›

CF 29C - Mail Stamps

Each stamp describes a direct transfer between two cities. If the envelope contains n stamps, then the letter passed through exactly n + 1 cities in sequence. The route never revisits a city, so the entire journey forms a simple path.
codeforces competitive-programming data-structures dfs-and-similar graphs implementation May 28, 2026
Practice › Codeforces Solutions › Codeforces Beta Round 29 (Div. 2, Codeforces format) ›

CF 29D - Ant on the Tree

We are asked to construct a path for an ant on a tree. The tree has n vertices, with vertex 1 as the root, and n-1 edges connecting them so the graph is connected.
codeforces competitive-programming constructive-algorithms dfs-and-similar trees May 28, 2026
Practice › Codeforces Solutions › Codeforces Beta Round 29 (Div. 2, Codeforces format) ›

CF 29E - Quarrel

We are asked to route two people, Bob and Alex, across a town represented as an undirected graph with n crossroads and m roads. Bob starts at node 1 and wants to reach node n, while Alex starts at node n and wants to reach node 1.
codeforces competitive-programming graphs shortest-paths May 28, 2026