Codeforces Round 715 (Div. 2)

Solutions for Codeforces Round 715 (Div. 2) (contest 1509). 2/3 problems verified against sample I/O. Difficulty range: 800-1800.

3 items

Codeforces Round 715 (Div. 2)

Type: Div. 2 | Problems: 3 | Verified: 2/3 | Rating range: 800-1800 | Time: 21m 12s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Average Height	800	constructive-algorithms	3m 1s	✗
B	TMT Document	1100	greedy	15m 59s	✓
C	The Sports Festival	1800	dp, greedy	2m 12s	✓

Practice › Codeforces Solutions › Codeforces Round 715 (Div. 2) ›

CF 1509B - TMT Document

Thanks for providing the details. I have traced the algorithm carefully. The core issue is not with choosing a product ending with the desired digit - the previously produced output 11 8 13 indeed multiplies to 1144 and ends with 4.

Practice › Codeforces Solutions › Codeforces Round 715 (Div. 2) ›

CF 1509A - Average Height

We are asked to arrange a set of students in a line so that the number of photogenic consecutive pairs is maximized. A pair is photogenic if the average of their heights is an integer. The input consists of multiple test cases.

Practice › Codeforces Solutions › Codeforces Round 715 (Div. 2) ›

CF 1509C - The Sports Festival

We are given the running speeds of all council members. We may choose any order in which they run. For every prefix of the chosen order, we look at all runners that have already participated.