Codeforces Round 130 (Div. 2)

Solutions for Codeforces Round 130 (Div. 2) (contest 208). 4/4 problems verified against sample I/O. Difficulty range: 900-2100.

4 items

Codeforces Round 130 (Div. 2)

Type: Div. 2 | Problems: 4 | Verified: 4/4 | Rating range: 900-2100 | Time: 4m 49s

Problem Name Rating Tags Solve Time Verified
A Dubstep 900 strings 59s ✓
C Police Station 1900 dp, graphs, shortest-paths 1m 18s ✓
D Prizes, Prizes, more Prizes 1200 implementation 1m 26s ✓
E Blood Cousins 2100 binary-search, data-structures, dfs-and-similar 1m 6s ✓
Practice › Codeforces Solutions › Codeforces Round 130 (Div. 2) ›

CF 208A - Dubstep

We are given a single compressed string that represents a song that was modified by repeatedly inserting the marker string "WUB" before, after, and between the original words.
codeforces competitive-programming strings May 29, 2026
Practice › Codeforces Solutions › Codeforces Round 130 (Div. 2) ›

CF 208C - Police Station

We are given an undirected, connected graph representing cities and roads. Every pair of cities is reachable, and each road has equal travel time. Among all pairs of cities, we are especially interested in shortest routes between city 1 and city n.
codeforces competitive-programming dp graphs shortest-paths May 29, 2026
Practice › Codeforces Solutions › Codeforces Round 130 (Div. 2) ›

CF 208D - Prizes, Prizes, more Prizes

In this problem, we are asked to simulate Vasya's prize redemption strategy. Vasya collects points from chocolate bar wrappings over time. Each wrapping contributes a certain number of points, and the points accumulate sequentially.
codeforces competitive-programming implementation May 29, 2026
Practice › Codeforces Solutions › Codeforces Round 130 (Div. 2) ›

CF 208E - Blood Cousins

We are given a rooted forest representing family relationships, where each node corresponds to a person, and each edge points from a child to their parent. A person may have no parent, in which case they are a root of one of the trees in the forest.
codeforces competitive-programming binary-search data-structures dfs-and-similar trees May 29, 2026