Codeforces Beta Round 78 (Div. 1 Only)

Solutions for Codeforces Beta Round 78 (Div. 1 Only) (contest 98). 5/5 problems verified against sample I/O. Difficulty range: 1700-2700.

5 items

Codeforces Beta Round 78 (Div. 1 Only)

Type: Div. 1 | Problems: 5 | Verified: 5/5 | Rating range: 1700-2700 | Time: 10m 13s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Help Victoria the Wise	1700	brute-force, implementation	2m 12s	✓
B	Help King	2200	implementation, probabilities, trees	1m 17s	✓
C	Help Greg the Dwarf	2500	geometry, ternary-search	2m 29s	✓
D	Help Monks	2500	constructive-algorithms	1m 50s	✓
E	Help Shrek and Donkey	2700	dp, games, math	2m 25s	✓

Practice › Codeforces Solutions › Codeforces Beta Round 78 (Div. 1 Only) ›

CF 98A - Help Victoria the Wise

We have six gems, each with one of six possible colors. The six gems must be placed onto the six faces of a cube. Two placements are considered identical if one can be rotated into the other. The input is simply a string of length six.

Practice › Codeforces Solutions › Codeforces Beta Round 78 (Div. 1 Only) ›

CF 98B - Help King

We are asked to simulate a fair random selection of one knight out of n using a coin that can only produce two outcomes. Each coin flip has an equal probability of landing heads or tails.

Practice › Codeforces Solutions › Codeforces Beta Round 78 (Div. 1 Only) ›

CF 98C - Help Greg the Dwarf

We have an L-shaped corridor with widths a and b on the two branches. A rectangular coffin of fixed length l must be moved through the corner.

Practice › Codeforces Solutions › Codeforces Beta Round 78 (Div. 1 Only) ›

CF 98D - Help Monks

We are given a Tower of Hanoi variant with three pillars and n disks stacked on the first pillar. The disks are listed from bottom to top, and unlike the classical problem, several disks may have the same diameter. A move still transfers exactly one disk between pillars.

Practice › Codeforces Solutions › Codeforces Beta Round 78 (Div. 1 Only) ›

CF 98E - Help Shrek and Donkey

There are m + n + 1 distinct cards in total. Shrek initially knows his own m cards, Donkey knows his own n cards, and one card is hidden on the table. Nobody knows the hidden card directly. Players alternate turns, with Shrek moving first.