Codeforces Round 484 (Div. 2)

3 problems from Codeforces Round 484 (Div. 2) (contest 982), difficulty 1200-2600. 3/3 solutions verified against sample I/O.

3 items

Codeforces Round 484 (Div. 2)

Div. 2 | 3 problems | 3/3 verified | Difficulty 1200-2600 | 3m 50s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Row	1200	brute-force, constructive-algorithms	9,711	1m 2s	✓
C	Cut 'em all!	1500	dfs-and-similar, dp, graphs	15,845	1m 21s	✓
E	Billiard	2600	geometry, number-theory	827	1m 27s	✓

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

CF 982E - Billiard

We are given a rectangular billiard table with corners at $(0,0)$, $(n,0)$, $(0,m)$, and $(n,m)$. A point-like ball starts from $(x,y)$ and moves in a straight line with direction components restricted to $-1, 0, 1$, meaning it travels horizontally, vertically, or along a…

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

CF 982C - Cut 'em all!

We are given a tree, meaning a connected graph with no cycles, and every edge is available for us to potentially remove. The operation we are allowed to perform is cutting edges so that the graph splits into smaller connected components.

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

CF 982A - Row

We are given a line of chairs, each either occupied by a person or empty. The configuration is represented as a binary string where 1 means a person is sitting and 0 means the seat is empty. A seating arrangement is considered valid only if no two people sit next to each other.