Codeforces Round 159 (Div. 2)

Solutions for Codeforces Round 159 (Div. 2) (contest 257). 4/4 problems verified against sample I/O. Difficulty range: 1100-1900.

4 items

Codeforces Round 159 (Div. 2)

Type: Div. 2 | Problems: 4 | Verified: 4/4 | Rating range: 1100-1900 | Time: 6m 19s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Sockets	1100	greedy, implementation, sortings	1m 10s	✓
B	Playing Cubes	1300	games, greedy, implementation	1m 23s	✓
C	View Angle	1800	brute-force, geometry, math	2m 43s	✓
D	Sum	1900	greedy, math	1m 3s	✓

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

CF 257A - Sockets

Vasya has a set of electrical devices and a limited number of wall sockets in his flat. Additionally, he owns multiple supply-line filters, each of which provides extra sockets but occupies one itself when plugged in.

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

CF 257B - Playing Cubes

We are asked to simulate a game between two players arranging colored cubes in a line. Petya wants to maximize the number of consecutive cubes of the same color, while Vasya wants to maximize the number of consecutive cubes of different colors.

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

CF 257C - View Angle

We are asked to find the smallest angle with its vertex at the origin that contains all given points (mannequins) on a 2D plane. Each point is defined by integer coordinates, and no mannequin is located at the origin itself.

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

CF 257D - Sum

We are given a list of integers representing a sequence where each element is at least as large as the previous one but no more than double the previous one.