CoU CSE Fest 2025 - Inter University Programming Contest (Divisional)
11 problems from CoU CSE Fest 2025 - Inter University Programming Contest (Divisional) (contest 106057), difficulty -. 11/11 solutions verified against sample I/O.
CoU CSE Fest 2025 - Inter University Programming Contest (Divisional)
Special | 11 problems | 11/11 verified | Difficulty - | 8m 29s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | Decreasing Trees | 47s | ✓ | |||
| B | Dartboard | 1m 4s | ✓ | |||
| C | Prime Dominion | 50s | ✓ | |||
| D | Zero is not an option! | 41s | ✓ | |||
| E | Treasures in the Interval | 40s | ✓ | |||
| F | A Perfect Path | 53s | ✓ | |||
| G | MeX is not Max | 36s | ✓ | |||
| H | Mr. Benzene's Bachelor Trip | 43s | ✓ | |||
| I | Anapalindrome | 43s | ✓ | |||
| J | Co-Primal Ancestor | 53s | ✓ | |||
| K | Dreaming of National IUPC | 39s | ✓ |
CF 106057A - Decreasing Trees
We are counting a very specific family of rooted trees on labeled vertices from 1 to n. The tree is rooted at node 1, and labels behave in a monotone way along any root-to-node path: whenever we move away from the root, labels must strictly increase.
CF 106057D - Zero is not an option!
We are given a rectangular grid where each cell contains a non-negative integer. From each row, we must pick exactly one element. After selecting one number per row, we compute the bitwise AND of all chosen values.
CF 106057J - Co-Primal Ancestor
We are given a rooted tree where every node carries an integer value. For each query, two nodes are provided and we are asked to consider all nodes that lie on the path from the root down to the lowest common ancestor of those two nodes.
CF 106057I - Anapalindrome
We are given a single string, and we want to break it into contiguous pieces. Each piece is considered valid if its characters can be rearranged to form a palindrome. For every valid way to split the entire string, we assign a score equal to the number of pieces in that split.
CF 106057G - MeX is not Max
We are given one or more sequences of non-negative integers. For each sequence, we want to find the smallest non-negative integer that does not appear anywhere in that sequence. This value is called the MEX, short for “minimum excluded value”.
CF 106057E - Treasures in the Interval
We are given an initial array of length $N$. After that, a sequence of range updates modifies it: each update picks a segment $[L, R]$ and adds a value $d$ to every element inside that segment. Once all updates are applied, the array is fixed.
CF 106057H - Mr. Benzene's Bachelor Trip
We are given two integers, $k$ and $m$. Think of building a target sum $n$ by splitting it into exactly $k$ ordered parts, where each part is a non-negative integer. Two decompositions are different if any position in the $k$-tuple differs.
CF 106057C - Prime Dominion
We are given an integer array and we want to examine every contiguous segment of it. For each segment, we compute the greatest common divisor of all elements inside that segment.
CF 106057K - Dreaming of National IUPC
The task is intentionally minimal: there is no input to process and no computation to perform. The only requirement is to produce a single fixed sentence exactly as specified in the output format.
CF 106057F - A Perfect Path
We are given a tree where every node carries an integer value. For multiple queries, each query provides two nodes u and v, and we must decide whether the product of all values along the unique simple path between u and v forms a perfect square.