The 2025 Aleppo Collegiate programming contest

13 problems from The 2025 Aleppo Collegiate programming contest (contest 106007), difficulty -. 13/13 solutions verified against sample I/O.

13 items

The 2025 Aleppo Collegiate programming contest

Special | 13 problems | 13/13 verified | Difficulty - | 14m 29s

#	Problem	Time	✓
A	GCD MEX	1m 27s	✓
B	Random Shuffle?	1m 12s	✓
C	Pizza Man	56s	✓
D	Master of the Arena	1m 14s	✓
E	Clean White Paths	1m 5s	✓
F	Meen 3mk?	44s	✓
G	Nim Game In Byteland	1m 7s	✓
H	Minimum Path	1m 8s	✓
I	Reverse and Remove	51s	✓
J	Prefix GCD	55s	✓
K	And X Elements	1m 27s	✓
L	Equalize	1m 33s	✓
M	Maximum Or Permutation	50s	✓

Practice › Codeforces Solutions › The 2025 Aleppo Collegiate programming contest ›

CF 106007L - Equalize

We are given an array of length n and a fixed segment size m. In one operation we pick a contiguous block of exactly m elements and apply a bitwise OR with a query value x to every element in that block.

Practice › Codeforces Solutions › The 2025 Aleppo Collegiate programming contest ›

CF 106007M - Maximum Or Permutation

We are asked to arrange the numbers from 1 to n in a circular order, meaning we place them in a line but also connect the last element back to the first.

Practice › Codeforces Solutions › The 2025 Aleppo Collegiate programming contest ›

CF 106007K - And X Elements

We are simulating a process over an array where a single integer value v starts at zero and is updated step by step. At each position i, we must apply exactly one of two bitwise operations using the current array element a[i].

Practice › Codeforces Solutions › The 2025 Aleppo Collegiate programming contest ›

CF 106007I - Reverse and Remove

We are given a sequence of numbers and a number of operations to perform on it. Each operation always removes the current first element of the sequence, and then reverses whatever remains.

Practice › Codeforces Solutions › The 2025 Aleppo Collegiate programming contest ›

CF 106007H - Minimum Path

We are given several test cases, each consisting of an array indexed from 1 to n. We start at index 1 and must end at index n. The key movement rule is that from any current index i, we are allowed to jump to any other index j as long as their positions differ by at most 2.

Practice › Codeforces Solutions › The 2025 Aleppo Collegiate programming contest ›

CF 106007G - Nim Game In Byteland

We are given a directed graph with $n$ nodes, where each node represents a city and has at most two outgoing edges. Alice starts at city $1$ and wants to reach city $n$.

Practice › Codeforces Solutions › The 2025 Aleppo Collegiate programming contest ›

CF 106007E - Clean White Paths

We are given a tree where every vertex is colored either white or black. Over time, we perform updates that gradually turn vertices from white into black. After each update, we must compute a value that depends on how white vertices are distributed inside the tree.

Practice › Codeforces Solutions › The 2025 Aleppo Collegiate programming contest ›

CF 106007A - GCD MEX

We are asked to construct, for each test case, a small integer array $a$ with at most $n$ elements. From this array we form another collection $b$ by taking the greatest common divisor of every pair of distinct elements in $a$.

Practice › Codeforces Solutions › The 2025 Aleppo Collegiate programming contest ›

CF 106007D - Master of the Arena

We are given a directed tournament-like structure on n fighters, but not all outcomes are fixed. For every pair of fighters, either one is known to always beat the other, or the result is left undecided and we are free to assign it.

Practice › Codeforces Solutions › The 2025 Aleppo Collegiate programming contest ›

CF 106007B - Random Shuffle?

We are given an array of length $n$. We repeatedly perform an operation $m$ times, and each time we append one number to a growing sequence written on paper. Each operation has three random layers.

Practice › Codeforces Solutions › The 2025 Aleppo Collegiate programming contest ›

CF 106007J - Prefix GCD

We are working with arrays of length $n$, where each element is an integer between $1$ and $m$. For any fixed array, we compute a value by looking at prefixes: for each prefix ending at position $i$, we take the gcd of all elements in that prefix, and sum these gcd values over…

Practice › Codeforces Solutions › The 2025 Aleppo Collegiate programming contest ›

CF 106007F - Meen 3mk?

The task is intentionally not a typical algorithmic problem but a fixed-response query. The program receives a single prompt-like input asking who “your uncle” is, where “uncle” is used as a cultural metaphor for dominance or superiority.

Practice › Codeforces Solutions › The 2025 Aleppo Collegiate programming contest ›

CF 106007C - Pizza Man

We are simulating a pizza shop that serves a sequence of customers, each demanding a fixed number of pizza slices. The shop has a storage capacity of m, and at the beginning of each test case it is completely full.