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

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

5 items

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

Type: Div. 2 | Problems: 5 | Verified: 4/5 | Rating range: 1200-2400 | Time: 6m 52s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Worms Evolution	1200	implementation	1m 46s	✓
B	Sysadmin Bob	1500	greedy, implementation, strings	1m 11s	✓
C	Schedule	1700	implementation	58s	✓
D	Chocolate	2000	dfs-and-similar, implementation	59s	✓
E	TV Game	2400	dp	1m 58s	✗

Practice › Codeforces Solutions › Codeforces Beta Round 31 (Div. 2, Codeforces format) ›

CF 31A - Worms Evolution

We are given an array of worm lengths. Each position represents a different worm form, and we need to find three distinct indices such that the length at one index equals the sum of the lengths at the other two indices.

Practice › Codeforces Solutions › Codeforces Beta Round 31 (Div. 2, Codeforces format) ›

CF 31B - Sysadmin Bob

We are given a single string that represents multiple email addresses concatenated together with no separators. Each email address has the form A@B, where A and B are non-empty strings consisting of lowercase Latin letters.

Practice › Codeforces Solutions › Codeforces Beta Round 31 (Div. 2, Codeforces format) ›

CF 31C - Schedule

We are given a list of n lessons, each with a start and end time, scheduled in a single room. Two lessons overlap if one starts before another ends. The goal is to find which single lesson can be removed so that the remaining lessons have no overlaps.

Practice › Codeforces Solutions › Codeforces Beta Round 31 (Div. 2, Codeforces format) ›

CF 31D - Chocolate

We are given a rectangular chocolate bar with integer width _W_ and height _H_. Bob breaks the chocolate multiple times along vertical or horizontal lines that go from one edge to the opposite edge of a piece.

Practice › Codeforces Solutions › Codeforces Beta Round 31 (Div. 2, Codeforces format) ›

CF 31E - TV Game

We are given a string of 2n digits. The digits are processed strictly from left to right. At every step, either Homer or Marge takes the current leftmost digit and appends it to their own number. By the end, both players must have taken exactly n digits.