ICPC Dhaka 2025 Online Preliminary - Replay Contest

8 problems from ICPC Dhaka 2025 Online Preliminary - Replay Contest (contest 106315), difficulty -. 8/8 solutions verified against sample I/O.

8 items

ICPC Dhaka 2025 Online Preliminary - Replay Contest

ICPC/IOI | 8 problems | 8/8 verified | Difficulty - | 7m 39s

#	Problem	Time	✓
A	Delete, Deduct, and Destroy	1m 10s	✓
B	[Your Next Line Is, ](https://codeforces.com/problemset/problem/106315/B)	1m	✓
C	Least Compatible Ancestor	51s	✓
D	Magical Flower Garden	52s	✓
E	The Perfect View	1m 13s	✓
F	Over Counting	52s	✓
G	The Matrix	57s	✓
H	Chemical Reaction	44s	✓

Practice › Codeforces Solutions › ICPC Dhaka 2025 Online Preliminary - Replay Contest ›

CF 106315D - Magical Flower Garden

We are given an array of integers, representing a line of flowers. Each flower has a “color”, but what really matters for the problem is a derived value called saturation, defined as the number of set bits in the binary representation of the color.

Practice › Codeforces Solutions › ICPC Dhaka 2025 Online Preliminary - Replay Contest ›

CF 106315G - The Matrix

We are given a grid of non-negative integers. Each row produces a value by XOR-ing all numbers in that row, and each column produces a value by XOR-ing all numbers in that column. The total score of the grid is the sum of all row XORs plus the sum of all column XORs.

Practice › Codeforces Solutions › ICPC Dhaka 2025 Online Preliminary - Replay Contest ›

CF 106315F - Over Counting

We are given a binary string and we are allowed to permute its characters in every distinct way. For each resulting arrangement, we define a two-level “inversion counting process” on the binary array.

Practice › Codeforces Solutions › ICPC Dhaka 2025 Online Preliminary - Replay Contest ›

CF 106315A - Delete, Deduct, and Destroy

We are working with a decimal string that is repeatedly modified by single-digit updates. After each modification, we need to evaluate a function defined over all ways of deleting a digit from a number and measuring how much the value changes.

Practice › Codeforces Solutions › ICPC Dhaka 2025 Online Preliminary - Replay Contest ›

CF 106315H - Chemical Reaction

We start with a set of chemical types already present in a chamber. Each second, any pair of chemicals that has a known reaction rule can produce a new chemical type.

Practice › Codeforces Solutions › ICPC Dhaka 2025 Online Preliminary - Replay Contest ›

CF 106315E - The Perfect View

We are given several candidate cafe locations and several landmark points in the plane. For each fixed cafe location $Ci$, we consider every pair of distinct landmarks $Lj, Lk$. Each such pair together with the cafe forms a triangle $CiLjLk$.

Practice › Codeforces Solutions › ICPC Dhaka 2025 Online Preliminary - Replay Contest ›

CF 106315C - Least Compatible Ancestor

We are given a rooted tree with nodes labeled from 1 to n, where node 1 is the root. Each node u must be assigned a value au in the range [1, n]. The assignment is considered valid if it avoids a specific global consistency condition across all pairs of nodes.