Codeforces Round 159 (Div. 2)

5 problems from Codeforces Round 159 (Div. 2) (contest 257), difficulty 1100-2200. 2/5 solutions verified against sample I/O.

5 items

Codeforces Round 159 (Div. 2)

Div. 2 | 5 problems | 2/5 verified | Difficulty 1100-2200 | 13m 6s

# Problem Rating Tags Accepted Time ✓
A Sockets 1100 greedy, implementation, sortings 6,914 2m 10s ✓
B Playing Cubes 1300 games, greedy, implementation 7,773 2m 28s
C View Angle 1800 brute-force, geometry, math 4,719 2m 22s ✓
D Sum 1900 greedy, math 1,719 3m 7s
E Greedy Elevator 2200 data-structures, implementation 346 2m 59s
Practice › Codeforces Solutions › Codeforces Round 159 (Div. 2) ›

CF 257B - Playing Cubes

Codeforces 257B: Playing Cubes
codeforces competitive-programming games greedy implementation Jun 4, 2026
Practice › Codeforces Solutions › Codeforces Round 159 (Div. 2) ›

CF 257D - Sum

We are given an array of integers where each element is at least as large as the previous one and at most double the previous one. We are asked to assign either a plus or minus sign to each element to form a sum that lies between zero and the first element of the array.
codeforces competitive-programming greedy math Jun 4, 2026
Practice › Codeforces Solutions › Codeforces Round 159 (Div. 2) ›

CF 257E - Greedy Elevator

We have a single elevator in a building with floors 1..m. Each person appears at a known time t, starts on floor s, and wants to go to floor f.
codeforces competitive-programming data-structures implementation Jun 4, 2026
Practice › Codeforces Solutions › Codeforces Round 159 (Div. 2) ›

CF 257C - View Angle

We are asked to determine the smallest possible angle, with its vertex at the origin, that can enclose all given mannequins on a plane. Each mannequin has coordinates $(xi, yi)$, and no mannequin is located at the origin itself.
codeforces competitive-programming brute-force geometry math Jun 4, 2026
Practice › Codeforces Solutions › Codeforces Round 159 (Div. 2) ›

CF 257A - Sockets

We have k wall sockets available in the apartment. There are m electrical devices that eventually need power. We also own n power strips, where the i-th strip provides a[i] sockets. A power strip is not free to use.
codeforces competitive-programming greedy implementation sortings Jun 4, 2026