Testing Round 19 (Div. 3)

Solutions for Testing Round 19 (Div. 3) (contest 2010). 3/4 problems verified against sample I/O. Difficulty range: 800-1700.

4 items

Testing Round 19 (Div. 3)

Type: Div. 3 | Problems: 4 | Verified: 3/4 | Rating range: 800-1700 | Time: 4m 56s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Alternating Sum of Numbers	800	brute-force, implementation, math	1m 27s	✓
B	Three Brothers	800	brute-force, implementation, math	1m 11s	✗
C1	Message Transmission Error (easy version)	1400	brute-force, strings	39s	✓
C2	Message Transmission Error (hard version)	1700	hashing, string-suffix-structures, strings	1m 39s	✓

Practice › Codeforces Solutions › Testing Round 19 (Div. 3) ›

CF 2010C2 - Message Transmission Error (hard version)

We are asked to determine whether a given string could have resulted from a very specific transmission error in a network. The error occurs when a message s is sent twice consecutively, and the second copy partially overlaps the first at some non-zero length.

Practice › Codeforces Solutions › Testing Round 19 (Div. 3) ›

CF 2010A - Alternating Sum of Numbers

The task is to compute an alternating sum over a sequence of integers. Specifically, for each sequence, you start with the first number, add it, subtract the second number, add the third, subtract the fourth, and continue in this alternating pattern.

Practice › Codeforces Solutions › Testing Round 19 (Div. 3) ›

CF 2010B - Three Brothers

This is a Type B (proof) problem. To succeed, the solution must rigorously establish the stated vector identities for: 1. An equilateral triangle. 2. An arbitrary regular $n$-gon. 3. A regular tetrahedron.

Practice › Codeforces Solutions › Testing Round 19 (Div. 3) ›

CF 2010C1 - Message Transmission Error (easy version)

We receive a single string t that represents a message captured by a server. The server originally sends some string s twice in a row.