Codeforces Round 499 (Div. 1)

6 problems from Codeforces Round 499 (Div. 1) (contest 1010), difficulty 1500-3400. 4/6 solutions verified against sample I/O.

6 items

Codeforces Round 499 (Div. 1)

Div. 1 | 6 problems | 4/6 verified | Difficulty 1500-3400 | 15m 26s

# Problem Rating Tags Accepted Time ✓
A Fly 1500 binary-search, math 9,003 1m 41s ✓
B Rocket 1800 binary-search, interactive 6,386 2m 23s
C Border 1800 number-theory 5,930 4m 4s ✓
D Mars rover 2000 dfs-and-similar, graphs, implementation 2,563 1m 48s ✓
E Store 2700 data-structures 386 2m 29s ✓
F Tree 3400 fft, graphs, trees 261 3m 1s
Practice › Codeforces Solutions › Codeforces Round 499 (Div. 1) ›

CF 1010E - Store

We are given a 3D calendar system where every moment is uniquely identified by a triple consisting of a month, a day inside that month, and a second inside that day.
codeforces competitive-programming data-structures Jun 16, 2026
Practice › Codeforces Solutions › Codeforces Round 499 (Div. 1) ›

CF 1010F - Tree

We are given a rooted tree where the root is fixed at vertex 1 and every vertex has at most two children. After a process of “pruning”, we keep a connected set of vertices that must still contain the root.
codeforces competitive-programming fft graphs trees Jun 16, 2026
Practice › Codeforces Solutions › Codeforces Round 499 (Div. 1) ›

CF 1010C - Border

We are given a set of banknotes, each with a fixed positive value. Natasha can use any number of each type of banknote, including zero, so in effect she can form any total sum that is a non-negative integer linear combination of the given values.
codeforces competitive-programming number-theory Jun 16, 2026
Practice › Codeforces Solutions › Codeforces Round 499 (Div. 1) ›

CF 1010D - Mars rover

The structure we are given is a rooted tree where every node behaves like a logic component. Leaves are fixed boolean inputs, while internal nodes compute boolean values from their children using standard gates such as AND, OR, XOR, and NOT.
codeforces competitive-programming dfs-and-similar graphs implementation trees Jun 16, 2026
Practice › Codeforces Solutions › Codeforces Round 499 (Div. 1) ›

CF 1010B - Rocket

We are trying to determine an unknown integer $x$ in the range from 1 to $m$, but we are not allowed to see it directly. Instead, we can probe it by asking queries with a chosen number $y$.
codeforces competitive-programming binary-search interactive Jun 16, 2026
Practice › Codeforces Solutions › Codeforces Round 499 (Div. 1) ›

CF 1010A - Fly

We are given a fixed route of space travel that starts at Earth, visits several intermediate planets in order, reaches Mars, and then returns back to Earth.
codeforces competitive-programming binary-search math Jun 16, 2026