Codeforces Round 152 (Div. 1)

2 problems from Codeforces Round 152 (Div. 1) (contest 249), difficulty 2600-2700. 0/2 solutions verified against sample I/O.

2 items

Codeforces Round 152 (Div. 1)

Div. 1 | 2 problems | 0/2 verified | Difficulty 2600-2700 | 5m 24s

#	Problem	Rating	Tags	Accepted	Time	✓
D	Donkey and Stars	2700	data-structures, dp, geometry	509	1m 56s
E	Endless Matrix	2600	math	359	3m 28s

Practice › Codeforces Solutions › Codeforces Round 152 (Div. 1) ›

CF 249D - Donkey and Stars

We are asked to find the longest chain of stars the Donkey can select under a geometric rule. The stars are points on a plane, and we begin at the origin. From any star, we imagine two rays at fixed angles relative to the horizontal axis.

Practice › Codeforces Solutions › Codeforces Round 152 (Div. 1) ›

CF 249E - Endless Matrix

We are asked to work with an infinite matrix that is filled in a very specific order. Each cell contains a positive integer, starting from 1, and the ordering rule is based on the maximum of the row and column indices.