Codeforces Round 814 (Div. 2)

3 problems from Codeforces Round 814 (Div. 2) (contest 1719), difficulty 800-1400. 2/3 solutions verified against sample I/O.

3 items

Codeforces Round 814 (Div. 2)

Div. 2 | 3 problems | 2/3 verified | Difficulty 800-1400 | 11m 59s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Chip Game	800	games, math	26,817	1m 39s	✓
B	Mathematical Circus	800	constructive-algorithms, math	19,167	5m 53s
C	Fighting Tournament	1400	binary-search, data-structures, implementation	14,362	4m 27s	✓

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

CF 1719B - Mathematical Circus

We are given an even number $n$, and we must partition the integers from $1$ to $n$ into disjoint pairs. Each number must appear in exactly one pair, and the order inside each pair matters. For a pair $(a, b)$, we compute the expression $(a + k) cdot b$.

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

CF 1719C - Fighting Tournament

The tournament can be viewed as a queue that evolves over time. At the beginning, all athletes are arranged in increasing order of their indices.

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

CF 1719A - Chip Game

We have an $n times m$ board and a chip that starts in the lower-left corner. On each turn, a player chooses exactly one direction, either up or right, and moves the chip by any odd number of cells in that direction. The chip cannot leave the board.