Codeforces Beta Round 3

Solutions for Codeforces Beta Round 3 (contest 3). 4/4 problems verified against sample I/O. Difficulty range: 1000-2600.

4 items

Codeforces Beta Round 3

Type: Beta | Problems: 4 | Verified: 4/4 | Rating range: 1000-2600 | Time: 14m 42s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Shortest path of the king	1000	greedy, shortest-paths	4m 37s	✓
B	Lorry	1900	greedy, sortings	4m 5s	✓
C	Tic-tac-toe	1800	brute-force, games, implementation	4m 37s	✓
D	Least Cost Bracket Sequence	2600	greedy	1m 23s	✓

Practice › Codeforces Solutions › Codeforces Beta Round 3 ›

CF 3A - Shortest path of the king

We are asked to move a chess king from one square to another on a standard 8×8 board in the fewest number of moves. The king can move to any adjacent square in eight possible directions: vertically, horizontally, or diagonally.

Practice › Codeforces Solutions › Codeforces Beta Round 3 ›

CF 3B - Lorry

We have a lorry with capacity v. There are two kinds of boats.

Practice › Codeforces Solutions › Codeforces Beta Round 3 ›

CF 3C - Tic-tac-toe

We are given a snapshot of a tic-tac-toe board, represented as a 3×3 grid. Each cell is either empty (.), contains a cross (X), or contains a nought (0). The first player always places crosses, and the second player places noughts.

Practice › Codeforces Solutions › Codeforces Beta Round 3 ›

CF 3D - Least Cost Bracket Sequence

We are given a bracket string containing three kinds of characters: '(', ')', and '?'. Every '?' must eventually become either an opening or closing bracket. For each unknown position, the input provides two costs, one for replacing it with '(' and one for replacing it with ')'.