Uttara University Inter-University Programming Contest 2025

11 problems from Uttara University Inter-University Programming Contest 2025 (contest 105973), difficulty -. 11/11 solutions verified against sample I/O.

11 items

Uttara University Inter-University Programming Contest 2025

Special | 11 problems | 11/11 verified | Difficulty - | 12m 37s

#	Problem	Time	✓
A	Edgy Graph	1m 8s	✓
B	Red Dead Redemption 2	1m 26s	✓
C	Binomial XOR	1m 17s	✓
D	Symmetric Swap	1m 11s	✓
E	The Perfect Spider Web	1m 8s	✓
F	Divisible Perfection	56s	✓
G	MEX-imum Beauty	1m 19s	✓
H	Substring Symphony	1m 14s	✓
I	Statue on a Permutation	1m 2s	✓
J	Sublime Replacement	1m 2s	✓
K	Math Madness	54s	✓

Practice › Codeforces Solutions › Uttara University Inter-University Programming Contest 2025 ›

CF 105973K - Math Madness

We are given several test cases. In each test case, we receive an array of integers, and we must count how many index pairs $(i, j)$ with $1 le i le j le n$ satisfy a certain arithmetic condition involving greatest common divisor and least common multiple of the two chosen…

Practice › Codeforces Solutions › Uttara University Inter-University Programming Contest 2025 ›

CF 105973J - Sublime Replacement

We are given an array where some positions are already fixed and some positions are marked as unknown with value −1. We are allowed to replace each unknown position with any positive integer up to $10^9$.

Practice › Codeforces Solutions › Uttara University Inter-University Programming Contest 2025 ›

CF 105973I - Statue on a Permutation

We are given a permutation that we are allowed to construct, and a starting position for a token placed on that permutation. From that starting point, two players alternately move the token.

Practice › Codeforces Solutions › Uttara University Inter-University Programming Contest 2025 ›

CF 105973G - MEX-imum Beauty

We are given an array, and we look at every contiguous subarray. For each subarray, we do a two-stage transformation. First, we replace it by its sequence of prefix maximums.

Practice › Codeforces Solutions › Uttara University Inter-University Programming Contest 2025 ›

CF 105973E - The Perfect Spider Web

We are given a convex polygon in the plane, described by its vertices in counter-clockwise order. Each edge of the polygon connects consecutive vertices, and the last vertex connects back to the first. We must choose a point strictly inside this polygon.

Practice › Codeforces Solutions › Uttara University Inter-University Programming Contest 2025 ›

CF 105973F - Divisible Perfection

We are given a string of digits, and we treat every contiguous substring as a number in base 10. The requirement is extremely strong: for every possible substring, the integer value formed by that substring must be divisible by the length of that substring.

Practice › Codeforces Solutions › Uttara University Inter-University Programming Contest 2025 ›

CF 105973B - Red Dead Redemption 2

We are given several test cases. In each test case, there is a list of items, each item has an integer value. The task is to split the items into two non-empty groups such that within each group, every pair of items is “compatible”, meaning their values share no common…

Practice › Codeforces Solutions › Uttara University Inter-University Programming Contest 2025 ›

CF 105973D - Symmetric Swap

We are given two arrays, and we are allowed to transform each array using two kinds of operations: cyclic shifts and a special swap operation that exchanges a prefix with a suffix of equal length.

Practice › Codeforces Solutions › Uttara University Inter-University Programming Contest 2025 ›

CF 105973A - Edgy Graph

We are given an undirected graph where each edge carries a positive integer weight. The task is to assign a value to every vertex so that for every edge, the larger of the two endpoint values is exactly equal to the edge’s weight.

Practice › Codeforces Solutions › Uttara University Inter-University Programming Contest 2025 ›

CF 105973H - Substring Symphony

We are given a fixed reference string a and another string b. For any contiguous substring c taken from b, we define a function that depends on how its internal substrings compare against a. For a chosen length k, we look at every contiguous substring of c of length k.

Practice › Codeforces Solutions › Uttara University Inter-University Programming Contest 2025 ›

CF 105973C - Binomial XOR

We are given a function defined on each integer position from 1 to n. For a fixed i, we look at all binomial coefficients in the i-th column of Pascal’s triangle, starting from row i up to row n, take each value modulo 998244353, and XOR them together. That gives f(i).