Codeforces Round 499 (Div. 2)

2 problems from Codeforces Round 499 (Div. 2) (contest 1011), difficulty 900-1200. 2/2 solutions verified against sample I/O.

2 items

Codeforces Round 499 (Div. 2)

Div. 2 | 2 problems | 2/2 verified | Difficulty 900-1200 | 3m 8s

# Problem Rating Tags Accepted Time ✓
A Stages 900 greedy, implementation, sortings 13,262 1m 43s ✓
B Planning The Expedition 1200 binary-search, brute-force, implementation 11,026 1m 25s ✓
Practice › Codeforces Solutions › Codeforces Round 499 (Div. 2) ›

CF 1011A - Stages

We are given a multiset of characters, each character representing a rocket stage with an intrinsic cost equal to its position in the alphabet.
codeforces competitive-programming greedy implementation sortings Jun 16, 2026
Practice › Codeforces Solutions › Codeforces Round 499 (Div. 2) ›

CF 1011B - Planning The Expedition

We are given a collection of food packages, each labeled by a type. There are also $n$ participants in an expedition, and time is measured in days. Each day, every participant consumes exactly one package.
codeforces competitive-programming binary-search brute-force implementation Jun 16, 2026