Codeforces Testing Round 2

5 problems from Codeforces Testing Round 2 (contest 125), difficulty 1000-2400. 4/5 solutions verified against sample I/O.

5 items

Codeforces Testing Round 2

Special | 5 problems | 4/5 verified | Difficulty 1000-2400 | 10m 21s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Measuring Lengths in Baden	1400	math	3,231	1m 27s	✓
B	Simple XML	1000	implementation	3,711	1m 46s	✓
C	Hobbits' Party	1600	constructive-algorithms, greedy	1,087	2m 17s	✓
D	Two progressions	2200	constructive-algorithms, greedy	439	2m 24s
E	MST Company	2400	binary-search, graphs	1,393	2m 27s	✓

Practice › Codeforces Solutions › Codeforces Testing Round 2 ›

CF 125A - Measuring Lengths in Baden

In Baden, the conversion rules are different from the real world. One inch equals 3 centimeters, and one foot contains 12 inches. We are given a length measured in centimeters. The task is to express that length as a combination of feet and inches.

Practice › Codeforces Solutions › Codeforces Testing Round 2 ›

CF 125D - Two progressions

We are given a sequence of distinct integers in a fixed order. Every element must be assigned to exactly one of two subsequences. Inside each subsequence, the original order must be preserved. The goal is to make both subsequences arithmetic progressions.

Practice › Codeforces Solutions › Codeforces Testing Round 2 ›

CF 125E - MST Company

We are given a weighted undirected graph whose capital is vertex 1. We must choose a set of roads that connects all cities. Since the chosen graph must be connected and have minimum total weight, the solution will always be a spanning tree whenever a solution exists.

Practice › Codeforces Solutions › Codeforces Testing Round 2 ›

CF 125B - Simple XML

The input is a valid XML-like text built from tags of the form <a and </a, where the tag name is a single lowercase letter. Tags can be nested and multiple XML fragments can appear one after another. The task is not to validate the XML. Validity is already guaranteed.

Practice › Codeforces Solutions › Codeforces Testing Round 2 ›

CF 125C - Hobbits' Party

We have n hobbits and want to create as many party days as possible. Each day corresponds to a guest list, which is some non-empty subset of the hobbits. The guest lists must satisfy two conditions.