ICPC Asia Dhaka Regional Onsite 2025 — Replay Contest

10 problems from ICPC Asia Dhaka Regional Onsite 2025 — Replay Contest (contest 106270), difficulty -. 9/10 solutions verified against sample I/O.

10 items

ICPC Asia Dhaka Regional Onsite 2025 — Replay Contest

ICPC/IOI | 10 problems | 9/10 verified | Difficulty - | 14m 41s

# Problem Rating Tags Accepted Time ✓
A Mission Hexa 1m 16s ✓
B Boulevard of Broken Cars 5m 17s
C Gas Reservoir 59s ✓
D Save the Wonderland 54s ✓
E Love Marriage 1m 6s ✓
F Morning Walk 59s ✓
G Nonogram 1m 25s ✓
H Optimal Balancing Strategy 57s ✓
I Two Strings Attached 52s ✓
J C-Style String Length 56s ✓
Practice › Codeforces Solutions › ICPC Asia Dhaka Regional Onsite 2025 — Replay Contest ›

CF 106270B - Boulevard of Broken Cars

Codeforces 106270B: Boulevard of Broken Cars
codeforces competitive-programming Jun 20, 2026
Practice › Codeforces Solutions › ICPC Asia Dhaka Regional Onsite 2025 — Replay Contest ›

CF 106270J - C-Style String Length

We are given a string that represents the raw inside of a C-style string literal, but restricted to only two possible characters: backslash and zero.
codeforces competitive-programming Jun 20, 2026
Practice › Codeforces Solutions › ICPC Asia Dhaka Regional Onsite 2025 — Replay Contest ›

CF 106270F - Morning Walk

We are given a circular running track of fixed length. Kabul runs along this loop at a constant speed and keeps moving in one direction for a fixed duration.
codeforces competitive-programming Jun 19, 2026
Practice › Codeforces Solutions › ICPC Asia Dhaka Regional Onsite 2025 — Replay Contest ›

CF 106270H - Optimal Balancing Strategy

We are given an array of positive integers. We are allowed to repeatedly move prime factors between two positions using a controlled operation: pick a divisor $p$ of some element $Ai$, divide $Ai$ by $p$, and multiply another element $Aj$ by $p$.
codeforces competitive-programming Jun 19, 2026
Practice › Codeforces Solutions › ICPC Asia Dhaka Regional Onsite 2025 — Replay Contest ›

CF 106270D - Save the Wonderland

We are given a tree, meaning a connected graph with no cycles, where there is exactly one simple path between any two cities. We want to place exactly K guards on K chosen cities.
codeforces competitive-programming Jun 19, 2026
Practice › Codeforces Solutions › ICPC Asia Dhaka Regional Onsite 2025 — Replay Contest ›

CF 106270I - Two Strings Attached

We are given two strings of equal length, call them A and B. We consider all possible ways to split A into a prefix and all possible ways to split B into a suffix, and compare that to the reverse construction where we take a prefix of B and a suffix of A.
codeforces competitive-programming Jun 18, 2026
Practice › Codeforces Solutions › ICPC Asia Dhaka Regional Onsite 2025 — Replay Contest ›

CF 106270G - Nonogram

We are given a one-dimensional strip of length $n$. Each cell must eventually be colored either black or white. Instead of choosing colors freely, we must form exactly $k$ contiguous black segments whose lengths are fixed as $b1, b2, dots, bk$, in that order.
codeforces competitive-programming Jun 18, 2026
Practice › Codeforces Solutions › ICPC Asia Dhaka Regional Onsite 2025 — Replay Contest ›

CF 106270E - Love Marriage

We are given a sequence of expected “happiness values” for n girls, visited in a fixed order. Shanto processes them one by one while maintaining a single current favorite.
codeforces competitive-programming Jun 18, 2026
Practice › Codeforces Solutions › ICPC Asia Dhaka Regional Onsite 2025 — Replay Contest ›

CF 106270A - Mission Hexa

The beehive can be viewed as an infinite hexagonal grid truncated after $n$ layers around a central cell labeled $0$. Each layer forms a perfect ring around the previous one, and every cell belongs to exactly one layer.
codeforces competitive-programming Jun 18, 2026
Practice › Codeforces Solutions › ICPC Asia Dhaka Regional Onsite 2025 — Replay Contest ›

CF 106270C - Gas Reservoir

We are given a 3D grid representing underground space. Each cell is either rock or gas, and every gas cell contains exactly one unit of gas.
codeforces competitive-programming Jun 18, 2026