Codeforces Round 274 (Div. 2)

5 problems from Codeforces Round 274 (Div. 2) (contest 479), difficulty 1000-1900. 3/5 solutions verified against sample I/O.

5 items

Codeforces Round 274 (Div. 2)

Div. 2 | 5 problems | 3/5 verified | Difficulty 1000-1900 | 19m 33s

# Problem Rating Tags Accepted Time ✓
A Expression 1000 brute-force, math 112,232 5m 21s
B Towers 1400 brute-force, constructive-algorithms, greedy 8,428 1m 3s ✓
C Exams 1400 greedy, sortings 33,065 10m 58s
D Long Jumps 1700 binary-search, greedy, implementation 5,009 1m 9s ✓
E Riding in a Lift 1900 combinatorics, dp 5,625 1m 2s ✓
Practice › Codeforces Solutions › Codeforces Round 274 (Div. 2) ›

CF 479A - Expression

Codeforces 479A: Expression
codeforces competitive-programming brute-force math May 30, 2026
Practice › Codeforces Solutions › Codeforces Round 274 (Div. 2) ›

CF 479B - Towers

We are given several stacks of unit cubes, each stack having an initial height. In a single move, we can take exactly one cube from the top of one stack and place it on top of another stack.
codeforces competitive-programming brute-force constructive-algorithms greedy implementation sortings May 30, 2026
Practice › Codeforces Solutions › Codeforces Round 274 (Div. 2) ›

CF 479C - Exams

We are given a collection of exams, each with two relevant days. The official schedule assigns exam i a day ai, but the student has a special agreement allowing him to take it earlier on day bi, where bi < ai.
codeforces competitive-programming greedy sortings May 30, 2026
Practice › Codeforces Solutions › Codeforces Round 274 (Div. 2) ›

CF 479D - Long Jumps

We are given a sorted set of marks on a number line from 0 to a length l, where each mark is an integer position. Some marks already exist, including the endpoints 0 and l. Using these marks, we can measure any distance that equals the difference between two existing marks.
codeforces competitive-programming binary-search greedy implementation May 30, 2026
Practice › Codeforces Solutions › Codeforces Round 274 (Div. 2) ›

CF 479E - Riding in a Lift

We are given a line of floors from 1 to n. We start on floor a and we will make exactly k moves. Each move picks a new floor y different from the current floor x, but with a restriction: we are not allowed to move “too far” in absolute distance compared to a forbidden floor…
codeforces competitive-programming combinatorics dp May 30, 2026