Codeforces Round 476 (Div. 2) [Thanks, Telegram!]

3 problems from Codeforces Round 476 (Div. 2) [Thanks, Telegram!] (contest 965), difficulty 1300-2200. 1/3 solutions verified against sample I/O.

3 items

Codeforces Round 476 (Div. 2) [Thanks, Telegram!]

Div. 2 | 3 problems | 1/3 verified | Difficulty 1300-2200 | 3m 22s

#	Problem	Rating	Tags	Accepted	Time	✓
B	Battleship	1300	implementation	4,767	1m 21s	✓
C	Greedy Arkady	2000	math	2,215	38s
E	Short Code	2200	data-structures, dp, greedy	1,880	1m 23s

Practice › Codeforces Solutions › Codeforces Round 476 (Div. 2) [Thanks, Telegram!] ›

CF 965E - Short Code

We are given a collection of distinct lowercase strings, each representing a variable name. For each original name, we must choose a non-empty prefix of that string to act as its new shortened identifier.

Practice › Codeforces Solutions › Codeforces Round 476 (Div. 2) [Thanks, Telegram!] ›

CF 965B - Battleship

We are given an $n times n$ grid where each cell is either forbidden or allowed. Forbidden cells are marked with and can never be part of a ship. Allowed cells are marked with . and may be part of a ship.

Practice › Codeforces Solutions › Codeforces Round 476 (Div. 2) [Thanks, Telegram!] ›

CF 965C - Greedy Arkady

We are given a linear stream of $n$ candies and a fixed number of people $k$. A single parameter $x$ determines how the candies are distributed: candies are processed in consecutive blocks of size $x$.