Codeforces Beta Round 25 (Div. 2 Only)

Solutions for Codeforces Beta Round 25 (Div. 2 Only) (contest 25). 5/5 problems verified against sample I/O. Difficulty range: 1100-2200.

5 items

Codeforces Beta Round 25 (Div. 2 Only)

Type: Div. 2 | Problems: 5 | Verified: 5/5 | Rating range: 1100-2200 | Time: 6m 12s

Problem	Name	Rating	Tags	Solve Time	Verified
A	IQ test	1300	brute-force	1m 7s	✓
B	Phone numbers	1100	implementation	1m 24s	✓
C	Roads in Berland	1900	graphs, shortest-paths	58s	✓
D	Roads not only in Berland	1900	dsu, graphs, trees	1m 15s	✓
E	Test	2200	hashing, strings	1m 28s	✓

Practice › Codeforces Solutions › Codeforces Beta Round 25 (Div. 2 Only) ›

CF 25A - IQ test

We are given a sequence of n natural numbers, where n is at least 3 and at most 100, and each number is at most 100. Among these numbers, all except one share the same parity - either even or odd - and exactly one number differs.

Practice › Codeforces Solutions › Codeforces Beta Round 25 (Div. 2 Only) ›

CF 25B - Phone numbers

We are given a string of digits representing a phone number. The task is to split this string into pieces where every piece has length either 2 or 3. The groups must appear in the original order, and they are joined with - characters in the output.

Practice › Codeforces Solutions › Codeforces Beta Round 25 (Div. 2 Only) ›

CF 25C - Roads in Berland

We are given a map of _n_ cities in Berland, where the shortest distances between all pairs are already known. Conceptually, this means the country is fully connected via some unknown set of roads, and the distance matrix is already the all-pairs shortest path result.

Practice › Codeforces Solutions › Codeforces Beta Round 25 (Div. 2 Only) ›

CF 25D - Roads not only in Berland

We are given a collection of n cities connected by n-1 roads. This means the current network forms a forest: a set of trees, because in graph terms, a connected tree with n nodes has exactly n-1 edges.

Practice › Codeforces Solutions › Codeforces Beta Round 25 (Div. 2 Only) ›

CF 25E - Test

We are given three lowercase strings. We want to build a single string that contains all three as substrings, and we want this resulting string to be as short as possible.