Codeforces Round 164 (Div. 2)

Solutions for Codeforces Round 164 (Div. 2) (contest 268). 3/4 problems verified against sample I/O. Difficulty range: 800-2300.

4 items

Codeforces Round 164 (Div. 2)

Type: Div. 2 | Problems: 4 | Verified: 3/4 | Rating range: 800-2300 | Time: 7m 8s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Games	800	brute-force	1m 29s	✓
C	Beautiful Sets of Points	1500	constructive-algorithms, implementation	1m 33s	✗
D	Wall Bars	2300	dp	2m 21s	✓
E	Playlist	2100	math, probabilities, sortings	1m 45s	✓

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

CF 268A - Games

Each football team owns two uniforms, a home uniform and a guest uniform. During a match, the host team normally wears its home uniform while the visiting team wears its guest uniform. There is one special situation.

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

CF 268C - Beautiful Sets of Points

We are asked to construct a set of points on a 2D integer grid with coordinates between 0 and n along the x-axis and 0 and m along the y-axis, excluding the origin (0,0). The set must satisfy the property that the Euclidean distance between any two points is not an integer.

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

CF 268D - Wall Bars

We have a vertical pole with bars attached at heights 1..n. Every bar points in one of four directions. A child can move between two bars if both bars point in the same direction and their height difference is at most h.

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

CF 268E - Playlist

We are asked to determine the maximum expected total listening time for Manao's playlist, given that each song has a certain probability of being liked and a fixed length.