Codeforces Beta Round 8

Solutions for Codeforces Beta Round 8 (contest 8). 5/5 problems verified against sample I/O. Difficulty range: 1200-2600.

5 items

Codeforces Beta Round 8

Type: Beta | Problems: 5 | Verified: 5/5 | Rating range: 1200-2600 | Time: 6m 59s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Train and Peter	1200	strings	1m 17s	✓
B	Obsession with Robots	1400	constructive-algorithms, graphs, implementation	56s	✓
C	Looking for Order	2000	bitmasks, dp	1m 48s	✓
D	Two Friends	2600	binary-search, geometry	1m 54s	✓
E	Beads	2600	dp, graphs	1m 4s	✓

Practice › Codeforces Solutions › Codeforces Beta Round 8 ›

CF 8A - Train and Peter

We are given a string that represents the sequence of station flags seen while traveling from city A to city B. Peter woke up twice during the trip and wrote down two substrings he saw, in chronological order.

Practice › Codeforces Solutions › Codeforces Beta Round 8 ›

CF 8B - Obsession with Robots

We are asked to analyze a robot's path on an infinite 2D grid. The robot can move up, down, left, or right, and its moves are recorded as a string of the characters U, D, L, R.

Practice › Codeforces Solutions › Codeforces Beta Round 8 ›

CF 8C - Looking for Order

We have a fixed starting point, the handbag, and up to 24 scattered objects on a 2D plane. Lena always starts at the handbag, walks around collecting at most two objects, returns to the handbag, then repeats until every object is stored back.

Practice › Codeforces Solutions › Codeforces Beta Round 8 ›

CF 8D - Two Friends

We have three points on a plane: the cinema, the house, and the shop.

Practice › Codeforces Solutions › Codeforces Beta Round 8 ›

CF 8E - Beads

We are asked to generate a specific string of beads of length n according to a Martian’s unique notion of string equivalence. Each bead is either red (0) or blue (1).