MTB Presents AUST Inter University Programming Contest 2025

11 problems from MTB Presents AUST Inter University Programming Contest 2025 (contest 105723), difficulty -. 11/11 solutions verified against sample I/O.

11 items

MTB Presents AUST Inter University Programming Contest 2025

Special | 11 problems | 11/11 verified | Difficulty - | 11m 6s

# Problem Rating Tags Accepted Time ✓
A Max-Min Madness 58s ✓
B The Absolute MEX Challenge 48s ✓
C Palindromic Palindrome Partition 1m 22s ✓
D Strong Tree 48s ✓
E Aloy and the Forbidden Code 47s ✓
F Rotating Painter 1m 2s ✓
G GCD and LCM in Perfect Sync 52s ✓
H Flip to Zero 1m 3s ✓
I The Art of Rearrangement 50s ✓
J No Duplicates 1m 31s ✓
K Primal Brackets 1m 5s ✓
Practice › Codeforces Solutions › MTB Presents AUST Inter University Programming Contest 2025 ›

CF 105723J - No Duplicates

We are building sequences of length $n$, where each position holds a value from $1$ to $m$. The twist is that we are given a growing list of interval constraints.
codeforces competitive-programming Jun 22, 2026
Practice › Codeforces Solutions › MTB Presents AUST Inter University Programming Contest 2025 ›

CF 105723K - Primal Brackets

We are given a sequence of signed integers that behaves like a properly nested structure, similar to a multi-type bracket system.
codeforces competitive-programming Jun 22, 2026
Practice › Codeforces Solutions › MTB Presents AUST Inter University Programming Contest 2025 ›

CF 105723I - The Art of Rearrangement

We are given several test cases, each containing an array of integers. For each array, we are allowed to reorder its elements arbitrarily. After reordering, we compute a derived value at every position, defined as the value placed there minus its position index.
codeforces competitive-programming Jun 22, 2026
Practice › Codeforces Solutions › MTB Presents AUST Inter University Programming Contest 2025 ›

CF 105723H - Flip to Zero

We start with a binary string that always has a very rigid structure: some prefix of zeros followed by a suffix of ones. The parameter $m$ determines how many ones appear at the end, so the string is fully determined by a single number rather than arbitrary bit patterns.
codeforces competitive-programming Jun 22, 2026
Practice › Codeforces Solutions › MTB Presents AUST Inter University Programming Contest 2025 ›

CF 105723G - GCD and LCM in Perfect Sync

We are given a fixed integer a1 and a length n. We need to count how many sequences of positive integers a2, a3, ...
codeforces competitive-programming Jun 22, 2026
Practice › Codeforces Solutions › MTB Presents AUST Inter University Programming Contest 2025 ›

CF 105723F - Rotating Painter

Two regular polygons share the same center, one placed above the other. The top polygon can freely rotate while the bottom polygon stays fixed. Because the top shape hides part of the bottom one, only the uncovered region of the bottom is paintable at any moment.
codeforces competitive-programming Jun 22, 2026
Practice › Codeforces Solutions › MTB Presents AUST Inter University Programming Contest 2025 ›

CF 105723E - Aloy and the Forbidden Code

We are given a string made only of the characters a, b, and c. The string is guaranteed to have no two equal characters next to each other, and all three characters appear at least once somewhere in the string.
codeforces competitive-programming Jun 22, 2026
Practice › Codeforces Solutions › MTB Presents AUST Inter University Programming Contest 2025 ›

CF 105723D - Strong Tree

We are given a rooted tree with vertex 1 as the root. Each vertex carries a numeric value and also a unique rank. The task is not about arbitrary paths in the tree, but about very specific paths constrained by ancestry and by rank filtering.
codeforces competitive-programming Jun 22, 2026
Practice › Codeforces Solutions › MTB Presents AUST Inter University Programming Contest 2025 ›

CF 105723C - Palindromic Palindrome Partition

We are asked to take a string and split it into contiguous pieces. Every piece must read the same forwards and backwards, so each segment is a palindrome.
codeforces competitive-programming Jun 22, 2026
Practice › Codeforces Solutions › MTB Presents AUST Inter University Programming Contest 2025 ›

CF 105723A - Max-Min Madness

We are given an array of integers, and we repeatedly apply two types of operations. The first operation is simple: pick any position with a positive value and reduce it by one.
codeforces competitive-programming Jun 22, 2026
Practice › Codeforces Solutions › MTB Presents AUST Inter University Programming Contest 2025 ›

CF 105723B - The Absolute MEX Challenge

We are asked to build a permutation of the numbers from 1 to n. For each position i, we compare the value placed there with its index and take the absolute difference. This produces a multiset of n values.
codeforces competitive-programming Jun 22, 2026