Testing Round 14 (Unrated)

Solutions for Testing Round 14 (Unrated) (contest 910). 1/3 problems verified against sample I/O. Difficulty range: 800-1700.

3 items

Testing Round 14 (Unrated)

Type: Special | Problems: 3 | Verified: 1/3 | Rating range: 800-1700 | Time: 26m 11s

Problem	Name	Rating	Tags	Solve Time	Verified
A	The Way to Home	800	dfs-and-similar, dp, greedy	12m 30s	✓
B	Door Frames	1600	greedy, implementation	9m 58s	✗
C	Minimum Sum	1700	constructive-algorithms, greedy, math	3m 43s	✗

Practice › Codeforces Solutions › Testing Round 14 (Unrated) ›

CF 910A - The Way to Home

We are given a one-dimensional line of positions from 1 to n. Some positions contain a lily, represented by a 1, while others are empty, represented by a 0. A frog starts at position 1 and wants to reach position n.

Practice › Codeforces Solutions › Testing Round 14 (Unrated) ›

CF 910B - Door Frames

We have a workshop scenario where Petya wants to build two identical door frames using uniform wooden bars of length n. Each door frame consists of three sides: two vertical sides of length a and one horizontal top of length b.

Practice › Codeforces Solutions › Testing Round 14 (Unrated) ›

CF 910C - Minimum Sum

We are given several strings made from the letters 'a' through 'j'. Originally, these strings were decimal numbers. A prankster replaced every digit with a unique letter, creating a one-to-one correspondence between the ten digits 0...9 and the ten letters a...j.