Codeforces Beta Round 82 (Div. 2)

5 problems from Codeforces Beta Round 82 (Div. 2) (contest 106), difficulty 1000-2100. 4/5 solutions verified against sample I/O.

5 items

Codeforces Beta Round 82 (Div. 2)

Div. 2 | 5 problems | 4/5 verified | Difficulty 1000-2100 | 13m 18s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Card Game	1000	implementation	8,535	1m 37s	✓
B	Choosing Laptop	1000	brute-force, implementation	6,867	2m 3s	✓
C	Buns	1700	dp	7,059	1m 50s	✓
D	Treasure Island	1700	brute-force, implementation	1,471	2m 25s	✓
E	Space Rescuers	2100	geometry, ternary-search	997	5m 23s

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

CF 106A - Card Game

We are given the trump suit for a game of Durak and two cards. The task is to decide whether the first card can beat the second card under the game rules. Each card has a rank and a suit. The ranks are ordered as: A card can beat another card in exactly two situations.

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

CF 106B - Choosing Laptop

Each laptop has four values: processor speed, RAM size, HDD size, and price. A laptop is considered outdated if there exists another laptop that is strictly better in all three technical characteristics at the same time.

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

CF 106C - Buns

Lavrenty has a fixed amount of dough and several types of stuffing. Each stuffing type has a limited quantity and requires a certain amount of dough to make a bun, and each bun yields a profit.

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

CF 106D - Treasure Island

We are given a grid representing an island with impassable sea cells and traversable land cells. Some of the land cells contain unique local sights labeled with uppercase letters.

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

CF 106E - Space Rescuers

We are asked to place a space rescue station in three-dimensional space such that the maximum distance from it to any of the given planets is minimized. Each planet is represented by its coordinates $(x, y, z)$.