The 2023 Damascus University Collegiate Programming Contest

13 problems from The 2023 Damascus University Collegiate Programming Contest (contest 104468), difficulty -. 2/13 solutions verified against sample I/O.

13 items

The 2023 Damascus University Collegiate Programming Contest

Special | 13 problems | 2/13 verified | Difficulty - | 25m 29s

# Problem Rating Tags Accepted Time ✓
A Salahiano-utiful Arrays 1m 30s
B Osama-utiful Components 3m 6s
C Ammar-utiful Permutations 1m 24s
D DBSucks-ugly Array 1m 42s
E Tareq-utiful Tree 1m 38s
F Resli-utiful Pair 3m 19s
G Wael-utiful Array 2m 8s
H Ammar-utiful Array 1m 38s ✓
I Obada-utiful Graph 1m 35s
J Elias-utiful Array 1m 46s
K Damas-utiful vs Aleppo-utiful 1m 6s ✓
L Khaled-utiful Vertices 3m 10s
M Resli-utiful Indices 1m 27s
Practice › Codeforces Solutions › The 2023 Damascus University Collegiate Programming Contest ›

CF 104468L - Khaled-utiful Vertices

We are given a rooted tree where each node has a value. We want to build a subset of nodes under a constraint that depends on a parameter $K$.
codeforces competitive-programming Jun 30, 2026
Practice › Codeforces Solutions › The 2023 Damascus University Collegiate Programming Contest ›

CF 104468M - Resli-utiful Indices

We are working with permutations of length $N$, so every valid arrangement is a reordering of the numbers from $1$ to $N$. The only structural property we care about is whether a position $i$ is a descent, meaning $Pi P{i+1}$.
codeforces competitive-programming Jun 30, 2026
Practice › Codeforces Solutions › The 2023 Damascus University Collegiate Programming Contest ›

CF 104468K - Damas-utiful vs Aleppo-utiful

The task is intentionally minimalistic: the input contains no meaningful structured data that affects computation. There is a single prompt-like line, but it does not encode any decision parameters such as numbers, arrays, or graphs.
codeforces competitive-programming Jun 30, 2026
Practice › Codeforces Solutions › The 2023 Damascus University Collegiate Programming Contest ›

CF 104468J - Elias-utiful Array

We are given several independent test cases. In each one, there is an array of integers, and we are allowed to pick a subset of these values. The subset is considered valid if every pair of chosen elements satisfies a specific bitwise inequality involving AND and XOR.
codeforces competitive-programming Jun 30, 2026
Practice › Codeforces Solutions › The 2023 Damascus University Collegiate Programming Contest ›

CF 104468F - Resli-utiful Pair

We are maintaining a graph that starts with isolated vertices. Each vertex carries a value in the range from 1 to N. Over time, edges are added, so connected components gradually merge. For any snapshot in time, we focus on the connected component containing a queried vertex.
codeforces competitive-programming Jun 30, 2026
Practice › Codeforces Solutions › The 2023 Damascus University Collegiate Programming Contest ›

CF 104468I - Obada-utiful Graph

We are given a permutation $P$ of size $N$. From this permutation we build an undirected graph on vertices $1 dots N$.
codeforces competitive-programming Jun 30, 2026
Practice › Codeforces Solutions › The 2023 Damascus University Collegiate Programming Contest ›

CF 104468G - Wael-utiful Array

We are given multiple test cases. In each test case, we start with an array of integers and must choose a subsequence, preserving order, possibly skipping elements. From that chosen subsequence, we look at every adjacent pair.
codeforces competitive-programming Jun 30, 2026
Practice › Codeforces Solutions › The 2023 Damascus University Collegiate Programming Contest ›

CF 104468H - Ammar-utiful Array

We are given a sequence of elements, each element has a value and a color. The sequence is fixed in order, but the values are not static. Over time, we apply global updates that affect almost all colors at once, and we also answer queries about one specific color.
codeforces competitive-programming Jun 30, 2026
Practice › Codeforces Solutions › The 2023 Damascus University Collegiate Programming Contest ›

CF 104468E - Tareq-utiful Tree

We are given a tree where each vertex carries a color label. The structure of the tree is fixed, but we are allowed to rearrange the colors arbitrarily using swaps between any two vertices. One swap exchanges the colors of two chosen nodes.
codeforces competitive-programming Jun 30, 2026
Practice › Codeforces Solutions › The 2023 Damascus University Collegiate Programming Contest ›

CF 104468D - DBSucks-ugly Array

We are given several independent test cases. In each test case, there is an array of integers and a limit value $M$. The task is to count how many integers $X$ in the range from 1 to $M$ have no prime factor in common with any element of the array.
codeforces competitive-programming Jun 30, 2026
Practice › Codeforces Solutions › The 2023 Damascus University Collegiate Programming Contest ›

CF 104468B - Osama-utiful Components

We are given a graph that evolves over time through edge insertions, and then we answer queries about the structure of connected components at earlier moments.
codeforces competitive-programming Jun 30, 2026
Practice › Codeforces Solutions › The 2023 Damascus University Collegiate Programming Contest ›

CF 104468A - Salahiano-utiful Arrays

We are given two arrays of the same length. At each position we see a pair of values, and we are allowed to optionally swap the two values inside any chosen position.
codeforces competitive-programming Jun 30, 2026
Practice › Codeforces Solutions › The 2023 Damascus University Collegiate Programming Contest ›

CF 104468C - Ammar-utiful Permutations

We are asked to construct a permutation of the numbers from 1 to N such that exactly one adjacent pair has an odd sum. Every other adjacent pair must have an even sum. An adjacent sum is odd only when one number is even and the other is odd.
codeforces competitive-programming Jun 30, 2026