Codeforces Beta Round 41

5 problems from Codeforces Beta Round 41 (contest 42), difficulty 1400-2700. 4/5 solutions verified against sample I/O.

5 items

Codeforces Beta Round 41

Beta | 5 problems | 4/5 verified | Difficulty 1400-2700 | 10m 20s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Guilty --- to the kitchen!	1400	greedy, implementation	3,173	1m 32s	✓
B	Game of chess unfinished	1700	implementation	1,154	2m 3s	✓
C	Safe cracking	2200	brute-force, constructive-algorithms	567	1m 2s	✓
D	Strange town	2300	constructive-algorithms, math	485	1m 50s
E	Baldman and the military	2700	dfs-and-similar, graphs, trees	244	3m 53s	✓

Practice › Codeforces Solutions › Codeforces Beta Round 41 ›

CF 42A - Guilty --- to the kitchen!

We want to cook soup using several ingredients that must appear in a fixed ratio. If the recipe says the proportions are a1, a2, ..., an, then the final soup must contain:

Practice › Codeforces Solutions › Codeforces Beta Round 41 ›

CF 42B - Game of chess unfinished

We are given a chess position containing exactly four pieces on a standard 8×8 board. White has two rooks and one king, black has only a king. The position is already legal, meaning no two pieces share a square and the two kings are not adjacent.

Practice › Codeforces Solutions › Codeforces Beta Round 41 ›

CF 42D - Strange town

We are asked to construct a fully connected graph of _N_ tourist attractions, where each road has a distinct positive integer cost not exceeding 1000.

Practice › Codeforces Solutions › Codeforces Beta Round 41 ›

CF 42E - Baldman and the military

We are asked to prepare a set of additional undirected edges, called wormholes, on top of an unknown tunnel system.