Testing Round 10

4 problems from Testing Round 10 (contest 440), difficulty 800-2200. 2/4 solutions verified against sample I/O.

4 items

Testing Round 10

Special | 4 problems | 2/4 verified | Difficulty 800-2200 | 4m 59s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Forgotten Episode	800	implementation	8,918	1m 1s	✓
B	Balancer	1600	greedy, implementation	2,325	1m 3s	✓
C	One-Based Arithmetic	1800	brute-force, dfs-and-similar, divide-and-conquer	1,139	1m 30s
D	Berland Federalization	2200	dp, trees	942	1m 25s

Practice › Codeforces Solutions › Testing Round 10 ›

CF 440D - Berland Federalization

We are given a country with n towns connected by n - 1 roads. Because the number of roads is exactly one less than the number of towns and any town can reach the capital, the road network forms a tree.

Practice › Codeforces Solutions › Testing Round 10 ›

CF 440C - One-Based Arithmetic

We are asked to represent a given positive integer $n$ as a sum of numbers, where each number consists entirely of the digit 1 repeated one or more times.

Practice › Codeforces Solutions › Testing Round 10 ›

CF 440A - Forgotten Episode

We are asked to determine which episode Polycarpus has not watched in a season of a TV show. He has watched n - 1 episodes out of a total of n, each numbered consecutively from 1 to n.

Practice › Codeforces Solutions › Testing Round 10 ›

CF 440B - Balancer

We are given a row of matchboxes, each containing some number of matches. The total number of matches is divisible by the number of boxes, so there exists a target configuration where every box ends up holding exactly the same number.