Codeforces Beta Round 73 (Div. 1 Only)

Solutions for Codeforces Beta Round 73 (Div. 1 Only) (contest 87). 5/5 problems verified against sample I/O. Difficulty range: 1500-2600.

5 items

Codeforces Beta Round 73 (Div. 1 Only)

Type: Div. 1 | Problems: 5 | Verified: 5/5 | Rating range: 1500-2600 | Time: 9m 48s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Trains	1500	implementation, math	1m 15s	✓
B	Vasya and Types	1800	implementation, strings	1m 56s	✓
C	Interesting Game	2000	dp, games, math	1m 9s	✓
D	Beautiful Road	2300	dfs-and-similar, dp, dsu	2m 12s	✓
E	Mogohu-Rea Idol	2600	geometry	3m 16s	✓

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

CF 87A - Trains

Vasya is at the central station of a subway branch with two endpoints. Each endpoint corresponds to one of his girlfriends: Dasha or Masha. Trains to Dasha’s station arrive every a minutes and trains to Masha’s station arrive every b minutes.

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

CF 87B - Vasya and Types

The language in this problem has only two real base types, void and errtype. Every other type is defined through typedef, and every query asks us to evaluate a type expression with typeof. A type expression is built from a base name plus some number of and & operators.

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

CF 87C - Interesting Game

We are asked to analyze a two-player game with a single pile of n stones. The players alternate turns, starting with Serozha.

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

CF 87D - Beautiful Road

We are given a weighted tree with n cities and n - 1 roads. Every ordered pair of distinct cities represents one military campaign, so there are n (n - 1) total trips. For a trip from city u to city v, the army travels along the unique path between them.

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

CF 87E - Mogohu-Rea Idol

We have three convex polygons on the plane. From each polygon we must choose one point, and the average of these three chosen points must equal the position of the idol.