Codeforces Round 282 (Div. 1)

5 problems from Codeforces Round 282 (Div. 1) (contest 494), difficulty 1500-3200. 4/5 solutions verified against sample I/O.

5 items

Codeforces Round 282 (Div. 1)

Div. 1 | 5 problems | 4/5 verified | Difficulty 1500-3200 | 7m 13s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Treasure	1500	greedy	6,548	1m 33s	✓
B	Obsessive String	2000	dp, strings	3,111	1m 52s	✓
C	Helping People	2600	dp, probabilities	958	42s	✓
D	Birthday	2700	data-structures, dfs-and-similar, dp	669	1m 47s
E	Sharti	3200	data-structures, games	374	1m 19s	✓

Practice › Codeforces Solutions › Codeforces Round 282 (Div. 1) ›

CF 494E - Sharti

We are asked to determine the winner of a two-player combinatorial game played on an $n times n$ board. The board consists of black and white cells. Initially, only certain rectangles are white, and the rest are black.

Practice › Codeforces Solutions › Codeforces Round 282 (Div. 1) ›

CF 494B - Obsessive String

We are given two strings, s and t. The task is to count how many ways we can choose one or more non-overlapping substrings from s such that each chosen substring contains t somewhere inside it.

Practice › Codeforces Solutions › Codeforces Round 282 (Div. 1) ›

CF 494D - Birthday

We are given a rooted tree with n vertices, where vertex 1 is the root. Each edge has a positive weight, and the distance between any two vertices is the sum of the weights along the unique path connecting them.

Practice › Codeforces Solutions › Codeforces Round 282 (Div. 1) ›

CF 494A - Treasure

We are given a string consisting of three types of characters: opening parentheses, closing parentheses, and special placeholders. Each placeholder must be expanded into a positive number of closing parentheses.

Practice › Codeforces Solutions › Codeforces Round 282 (Div. 1) ›

CF 494C - Helping People

We are tasked with calculating the expected maximum wealth of a group of people after a series of charitable recommendations. Each person starts with a known amount of money.