Codeforces Round 253 (Div. 1)

Solutions for Codeforces Round 253 (Div. 1) (contest 442). 1/2 problems verified against sample I/O. Difficulty range: 1800-3100.

2 items

Codeforces Round 253 (Div. 1)

Type: Div. 1 | Problems: 2 | Verified: 1/2 | Rating range: 1800-3100 | Time: 3m 6s

Problem	Name	Rating	Tags	Solve Time	Verified
B	Andrey and Problem	1800	greedy, math, probabilities	1m 14s	✓
E	Gena and Second Distance	3100	geometry	1m 52s	✗

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

CF 442B - Andrey and Problem

We are given a set of friends, where each friend independently succeeds in producing a contest problem with a known probability. Andrey will invite some subset of these friends. Once invited, each friend either contributes a problem or does not, independently of the others.

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

CF 442E - Gena and Second Distance

We are asked to maximize a geometric metric called "beauty" within a rectangle. The rectangle is axis-aligned and has width w and height h. Inside it, there are n given points with coordinates (xi, yi).