Codeforces Round 610 (Div. 2)

5 problems from Codeforces Round 610 (Div. 2) (contest 1282), difficulty 900-2400. 1/5 solutions verified against sample I/O.

5 items

Codeforces Round 610 (Div. 2)

Div. 2 | 5 problems | 1/5 verified | Difficulty 900-2400 | 33m 32s

# Problem Rating Tags Accepted Time ✓
A Temporarily unavailable 900 implementation, math 15,499 1m 59s ✓
B1 K for the Price of One (Easy Version) 1400 dp, greedy, sortings 12,149 9m 50s
B2 K for the Price of One (Hard Version) 1600 dp, greedy, sortings 11,009 5m 59s
D Enchanted Artifact 2300 constructive-algorithms, interactive, strings 2,372 10m 8s
E The Cake Is a Lie 2400 constructive-algorithms, data-structures, dfs-and-similar 1,222 5m 36s
Practice › Codeforces Solutions › Codeforces Round 610 (Div. 2) ›

CF 1282D - Enchanted Artifact

We are interacting with a hidden binary string $s$ consisting only of characters a and b. We do not know its length, but it is at most 300. Our task is to discover $s$ using queries.
codeforces competitive-programming constructive-algorithms interactive strings Jun 16, 2026
Practice › Codeforces Solutions › Codeforces Round 610 (Div. 2) ›

CF 1282E - The Cake Is a Lie

We are given a collection of triangles that once formed a triangulation of a convex polygon with $n$ vertices. Each triangle corresponds to one cut made during a process where we repeatedly remove a boundary triangle from a convex polygon until nothing remains except the…
codeforces competitive-programming constructive-algorithms data-structures dfs-and-similar graphs Jun 16, 2026
Practice › Codeforces Solutions › Codeforces Round 610 (Div. 2) ›

CF 1282B1 - K for the Price of One (Easy Version)

We are given several independent test cases. In each one, Vasya has a budget and a list of item prices. He wants to maximize how many items he can take from the store. The store has a special promotion with groups of two items.
codeforces competitive-programming dp greedy sortings Jun 16, 2026
Practice › Codeforces Solutions › Codeforces Round 610 (Div. 2) ›

CF 1282B2 - K for the Price of One (Hard Version)

We are given a list of item prices and a budget. Vasya wants to maximize the number of items he acquires. He has two ways to buy: he can purchase a single item at its full price, or he can activate a bundle purchase where he chooses a “base” item and simultaneously takes up…
codeforces competitive-programming dp greedy sortings Jun 16, 2026
Practice › Codeforces Solutions › Codeforces Round 610 (Div. 2) ›

CF 1282A - Temporarily unavailable

We are given a person moving along a straight line segment from position a to position b at constant speed 1 unit per minute. Independently, there is a network base station at position c that covers everything within distance r.
codeforces competitive-programming implementation math Jun 11, 2026