Codeforces Beta Round 99 (Div. 1)

Solutions for Codeforces Beta Round 99 (Div. 1) (contest 138). 4/5 problems verified against sample I/O. Difficulty range: 1600-2900.

5 items

Codeforces Beta Round 99 (Div. 1)

Type: Div. 1 | Problems: 5 | Verified: 4/5 | Rating range: 1600-2900 | Time: 9m 53s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Literature Lesson	1600	implementation	2m	✓
B	Digits Permutations	1900	greedy	2m 29s	✗
C	Mushroom Gnomes - 2	2200	binary-search, data-structures, probabilities	2m	✓
D	World of Darkraft	2500	dp, games	2m 6s	✓
E	Hellish Constraints	2900	brute-force, dp, two-pointers	1m 18s	✓

Practice › Codeforces Solutions › Codeforces Beta Round 99 (Div. 1) ›

CF 138A - Literature Lesson

Each poem is divided into quatrains, groups of four lines. Two lines rhyme if the suffix starting from the k-th vowel from the end is identical in both lines. For example, with k = 1, we compare suffixes starting at the last vowel.

Practice › Codeforces Solutions › Codeforces Beta Round 99 (Div. 1) ›

CF 138B - Digits Permutations

We are given a decimal number as a string. We may independently permute its digits twice, producing two new numbers that contain exactly the same multiset of digits as the original number. Leading zeroes are allowed after permutation.

Practice › Codeforces Solutions › Codeforces Beta Round 99 (Div. 1) ›

CF 138C - Mushroom Gnomes - 2

We have trees placed on a number line. Each tree may fall left, fall right, or remain standing. The probabilities for these three outcomes are given independently for every tree. A falling tree destroys mushrooms in a half-open interval determined by the tree position and height.

Practice › Codeforces Solutions › Codeforces Beta Round 99 (Div. 1) ›

CF 138D - World of Darkraft

We have a rectangular board where every cell contains one of three symbols. A move selects an active cell and disables cells along diagonals passing through it. The exact diagonals depend on the symbol. A cell marked L attacks the two diagonals with constant i + j.

Practice › Codeforces Solutions › Codeforces Beta Round 99 (Div. 1) ›

CF 138E - Hellish Constraints

We are asked to count substrings of a given string that satisfy a complicated set of constraints. Each constraint specifies a letter and a minimum and maximum number of times that letter can appear.