Codeforces Round 130 (Div. 2)

5 problems from Codeforces Round 130 (Div. 2) (contest 208), difficulty 900-2100. 3/5 solutions verified against sample I/O.

5 items

Codeforces Round 130 (Div. 2)

Div. 2 | 5 problems | 3/5 verified | Difficulty 900-2100 | 9m 13s

# Problem Rating Tags Accepted Time ✓
A Dubstep 900 strings 105,014 1m 16s ✓
B Solitaire 1900 dfs-and-similar, dp 1,496 1m 21s ✓
C Police Station 1900 dp, graphs, shortest-paths 2,151 1m 56s ✓
D Prizes, Prizes, more Prizes 1200 implementation 8,047 2m 50s
E Blood Cousins 2100 binary-search, data-structures, dfs-and-similar 8,913 1m 50s
Practice › Codeforces Solutions › Codeforces Round 130 (Div. 2) ›

CF 208B - Solitaire

We are given a shuffled deck of up to 52 cards arranged in a line, each represented by a value and a suit. Initially, every card forms its own pile.
codeforces competitive-programming dfs-and-similar dp Jun 3, 2026
Practice › Codeforces Solutions › Codeforces Round 130 (Div. 2) ›

CF 208C - Police Station

We are given an undirected, connected graph representing cities and roads, where every road has the same travel time. Among all cities, city 1 and city n are special: we care about travel between these two endpoints.
codeforces competitive-programming dp graphs shortest-paths Jun 3, 2026
Practice › Codeforces Solutions › Codeforces Round 130 (Div. 2) ›

CF 208E - Blood Cousins

We are given a rooted forest where each person has at most one parent. If we follow parent pointers upward, we eventually reach a root or fall off the structure. This defines a collection of trees. A “k-th ancestor” means applying the parent relation k times.
codeforces competitive-programming binary-search data-structures dfs-and-similar trees Jun 3, 2026
Practice › Codeforces Solutions › Codeforces Round 130 (Div. 2) ›

CF 208D - Prizes, Prizes, more Prizes

We have a sequence of chocolate bar purchases, each yielding a certain number of points. Vasya starts with zero points and after each bar may go to the prize center. The prizes have fixed point costs: a mug, a towel, a bag, a bicycle, and a car, in strictly increasing order.
codeforces competitive-programming implementation Jun 3, 2026
Practice › Codeforces Solutions › Codeforces Round 130 (Div. 2) ›

CF 208A - Dubstep

The input is a single string that has been formed by taking a sequence of original words and then inserting the marker string "WUB" around and between them in a very specific way.
codeforces competitive-programming strings Jun 3, 2026