Codeforces Beta Round 8

5 problems from Codeforces Beta Round 8 (contest 8), difficulty 1200-2600. 5/5 solutions verified against sample I/O.

5 items

Codeforces Beta Round 8

Beta | 5 problems | 5/5 verified | Difficulty 1200-2600 | 6m 59s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Train and Peter	1200	strings	6,727	1m 17s	✓
B	Obsession with Robots	1400	constructive-algorithms, graphs, implementation	4,965	56s	✓
C	Looking for Order	2000	bitmasks, dp	4,212	1m 48s	✓
D	Two Friends	2600	binary-search, geometry	580	1m 54s	✓
E	Beads	2600	dp, graphs	758	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).