Codeforces Beta Round 59 (Div. 2)

5 problems from Codeforces Beta Round 59 (Div. 2) (contest 63), difficulty 900-2000. 4/5 solutions verified against sample I/O.

5 items

Codeforces Beta Round 59 (Div. 2)

Div. 2 | 5 problems | 4/5 verified | Difficulty 900-2000 | 8m 47s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Sinking Ship	900	implementation, sortings, strings	13,419	1m 31s	✓
B	Settlers' Training	1200	implementation	5,210	1m 35s	✓
C	Bulls and Cows	1700	brute-force, implementation	2,002	1m 48s	✓
D	Dividing Island	1900	constructive-algorithms	1,447	1m 40s
E	Sweets Game	2000	bitmasks, dfs-and-similar, dp	855	2m 13s	✓

Practice › Codeforces Solutions › Codeforces Beta Round 59 (Div. 2) ›

CF 63A - Sinking Ship

We are given a list of people standing in a fixed left-to-right order on a sinking ship. Every person has a name and a role. The evacuation order depends entirely on the role priority. Rats leave first. Women and children share the next priority level. Men leave after them.

Practice › Codeforces Solutions › Codeforces Beta Round 59 (Div. 2) ›

CF 63B - Settlers' Training

We have a group of soldiers, each with a rank between 1 and k. During one training session, soldiers are grouped by equal rank. From every group whose rank is still below k, exactly one soldier is promoted by one level.

Practice › Codeforces Solutions › Codeforces Beta Round 59 (Div. 2) ›

CF 63C - Bulls and Cows

We are playing the classic Bulls and Cows game with four-digit numbers whose digits are all distinct. Leading zeroes are allowed, so 0123 is valid, but repeated digits such as 0012 or 1223 are not. Each previous guess comes with two values.

Practice › Codeforces Solutions › Codeforces Beta Round 59 (Div. 2) ›

CF 63D - Dividing Island

We are asked to divide an island into connected territories for multiple parties. The island is represented by two rectangles placed side by side: one of size a by b and another of size c by d.

Practice › Codeforces Solutions › Codeforces Beta Round 59 (Div. 2) ›

CF 63E - Sweets Game

The board is a fixed hexagon with 19 cells. Some cells contain chocolates, some are empty. Two players alternate moves, and a move consists of choosing a contiguous segment of chocolates that lies on a straight line parallel to one of the three hexagon directions.