Codeforces Round 273 (Div. 2)

5 problems from Codeforces Round 273 (Div. 2) (contest 478), difficulty 1100-2900. 4/5 solutions verified against sample I/O.

5 items

Codeforces Round 273 (Div. 2)

Div. 2 | 5 problems | 4/5 verified | Difficulty 1100-2900 | 6m

# Problem Rating Tags Accepted Time ✓
A Initial Bet 1100 implementation 27,185 59s ✓
B Random Teams 1300 combinatorics, constructive-algorithms, greedy 41,253 1m 12s ✓
C Table Decorations 1800 greedy 20,587 1m 9s ✓
D Red-Green Towers 2000 dp 7,141 1m 3s ✓
E Wavy numbers 2900 brute-force, dfs-and-similar, meet-in-the-middle 253 1m 37s
Practice › Codeforces Solutions › Codeforces Round 273 (Div. 2) ›

CF 478A - Initial Bet

We are given the final state of a system with five participants who started a game under a very rigid rule: everyone begins with the same unknown positive number of coins, call it $b$. After this initialization, coins are only moved between players.
codeforces competitive-programming implementation May 30, 2026
Practice › Codeforces Solutions › Codeforces Round 273 (Div. 2) ›

CF 478B - Random Teams

We are given a set of $n$ people who must be partitioned into exactly $m$ non-empty groups. Once the grouping is fixed, every pair of people inside the same group becomes a friendship.
codeforces competitive-programming combinatorics constructive-algorithms greedy math May 30, 2026
Practice › Codeforces Solutions › Codeforces Round 273 (Div. 2) ›

CF 478C - Table Decorations

We have three types of balloons: red, green, and blue. Each table at a banquet requires exactly three balloons, and no table can have all three balloons of the same color.
codeforces competitive-programming greedy May 30, 2026
Practice › Codeforces Solutions › Codeforces Round 273 (Div. 2) ›

CF 478D - Red-Green Towers

We are asked to build a staircase-like structure made from two types of blocks, red and green. The structure has some number of levels, and the levels form a strict decreasing sequence in size: if the top level has size n, then the next has n-1, then n-2, and so on down to 1.
codeforces competitive-programming dp May 30, 2026
Practice › Codeforces Solutions › Codeforces Round 273 (Div. 2) ›

CF 478E - Wavy numbers

We are asked to work with a special class of integers defined purely by their digit structure. A number is called “wavy” if, whenever you look at any digit that is not at the boundary, that digit must sit either strictly above both its neighbors or strictly below both…
codeforces competitive-programming brute-force dfs-and-similar meet-in-the-middle sortings May 30, 2026