Codeforces Beta Round 57 (Div. 2)

Solutions for Codeforces Beta Round 57 (Div. 2) (contest 61). 5/5 problems verified against sample I/O. Difficulty range: 800-2000.

5 items

Codeforces Beta Round 57 (Div. 2)

Type: Div. 2 | Problems: 5 | Verified: 5/5 | Rating range: 800-2000 | Time: 14m 51s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Ultra-Fast Mathematician	800	implementation	2m 4s	✓
B	Hard Work	1300	strings	6m 35s	✓
C	Capture Valerian	2000	math	2m 49s	✓
D	Eternal Victory	1800	dfs-and-similar, graphs, greedy	1m 29s	✓
E	Enemy is weak	1900	data-structures, trees	1m 54s	✓

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

CF 61A - Ultra-Fast Mathematician

We are given two binary strings of equal length. Each character is either '0' or '1'. For every position, we compare the characters from the two strings. If the two characters are different, the resulting string gets '1' at that position.

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

CF 61B - Hard Work

We are given three original strings. A student's answer is considered correct if it can be formed by concatenating these three strings in any order, after ignoring two kinds of differences. The first difference is letter casing.

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

CF 61C - Capture Valerian

The problem asks us to convert a number from one base to another, with the twist that the target base may be either a standard positional numeral system (2 through 25) or the Roman numeral system.

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

CF 61D - Eternal Victory

We are asked to find the minimum distance Shapur must travel to visit all cities at least once. The cities are connected in a tree structure, meaning there are exactly $n-1$ bidirectional roads and a unique path between any two cities.

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

CF 61E - Enemy is weak

We are given an array of distinct integers representing the power of soldiers standing in a line. We need to count how many index triples (i, j, k) satisfy two conditions at the same time: - The positions are ordered as i < j < k - The values are strictly decreasing as a[i]…