Codeforces Round 152 (Div. 1)

Solutions for Codeforces Round 152 (Div. 1) (contest 249). 0/2 problems verified against sample I/O. Difficulty range: 2600-2700.

2 items

Codeforces Round 152 (Div. 1)

Type: Div. 1 | Problems: 2 | Verified: 0/2 | Rating range: 2600-2700 | Time: 5m 24s

Problem	Name	Rating	Tags	Solve Time	Verified
D	Donkey and Stars	2700	data-structures, dp, geometry	1m 56s	✗
E	Endless Matrix	2600	math	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.