Metropolitan University Inter University Programming Contest - Sylhet Division 2024
9 problems from Metropolitan University Inter University Programming Contest - Sylhet Division 2024 (contest 105530), difficulty -. 9/9 solutions verified against sample I/O.
Metropolitan University Inter University Programming Contest - Sylhet Division 2024
Special | 9 problems | 9/9 verified | Difficulty - | 8m 11s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | GCD Sort | 52s | ✓ | |||
| B | Modular MEX | 52s | ✓ | |||
| C | Too Much Walking | 50s | ✓ | |||
| D | Nice (Easy Version) | 48s | ✓ | |||
| E | Nice (Medium Version) | 50s | ✓ | |||
| F | Nice (Hard Version) | 1m 8s | ✓ | |||
| G | I am Tired of Xor Problems | 1m 5s | ✓ | |||
| H | Break the Walls | 54s | ✓ | |||
| I | Delete the String | 52s | ✓ |
CF 105530D - Nice (Easy Version)
The task is about choosing the smallest number from a very small fixed set that is not smaller than a given integer. The “nice numbers” are already known and limited to six specific values: 6, 9, 66, 69, 96, and 99.
CF 105530I - Delete the String
We are given a string, and we repeatedly perform an operation where we delete a contiguous segment. Each deletion removes a substring, and after deletions, the remaining characters collapse together as if the string is reindexed.
CF 105530H - Break the Walls
We are given a grid where movement is restricted to only two directions: right and down. Some cells contain obstacles, and normally stepping into an obstacle would block movement.
CF 105530G - I am Tired of Xor Problems
The task revolves around a multiset of values that are interpreted as exponents in a polynomial-like structure where addition is replaced by XOR.
CF 105530E - Nice (Medium Version)
We are looking at numbers formed using only two digits, 6 and 9. Any valid number is “nice” if every position is one of these two digits.
CF 105530B - Modular MEX
We are looking at all remainders produced by fixing a number $n$ and dividing it by every integer $i$ from $1$ to $n$. This gives a set of values of the form $n bmod i$.
CF 105530C - Too Much Walking
We are given a collection of points on a 2D grid, where each point can be thought of as a cell with integer coordinates. For every point, we want to determine how far it is from the farthest other point, where distance is measured using Manhattan distance.
CF 105530F - Nice (Hard Version)
We are working with numbers formed from decimal strings, but only two digits actually matter: 6 and 9. A number is considered “nice” if it can be interpreted under a very specific ordering rule that effectively treats these two digits as comparable states, and all other…
CF 105530A - GCD Sort
We are given a permutation of size $n$, meaning each number from $1$ to $n$ appears exactly once but in arbitrary order across positions $1$ to $n$. The task is to transform this permutation into the sorted order where value $i$ sits at position $i$.