CUET Inter University Programming Contest 2025

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

11 items

CUET Inter University Programming Contest 2025

Special | 11 problems | 11/11 verified | Difficulty - | 23m 54s

# Problem Rating Tags Accepted Time ✓
A Kill Two Birds with One Stone 1m 5s ✓
B K Floors Down 4m 11s ✓
C Pattern Purifier 4m 11s ✓
D The AND, The OR, and The XOR 46s ✓
E A Slice of Pi 1m 2s ✓
F Survival of the Fated 52s ✓
G Pascal's Tree 4m 25s ✓
H Prime Triangles 1m 17s ✓
I Peak Reduction 3m 45s ✓
J The Power of the Sun 55s ✓
K The Great Withering 1m 25s ✓
Practice › Codeforces Solutions › CUET Inter University Programming Contest 2025 ›

CF 106259B - K Floors Down

We are asked to consider all ways of building a sequence of length k, where each element is independently chosen from the given array a.
codeforces competitive-programming Jun 19, 2026
Practice › Codeforces Solutions › CUET Inter University Programming Contest 2025 ›

CF 106259C - Pattern Purifier

We are given a string made of lowercase letters, and we are allowed to repeatedly delete substrings as long as each deleted piece is both a palindrome and has even length.
codeforces competitive-programming Jun 19, 2026
Practice › Codeforces Solutions › CUET Inter University Programming Contest 2025 ›

CF 106259I - Peak Reduction

We are given a permutation, meaning a sequence containing every integer from 1 to n exactly once. The allowed operation is very specific: we may remove an element only if it is strictly inside the array and strictly greater than both of its current neighbors.
codeforces competitive-programming Jun 18, 2026
Practice › Codeforces Solutions › CUET Inter University Programming Contest 2025 ›

CF 106259G - Pascal's Tree

We are given a rooted tree on n nodes, and a permutation p that places every node exactly once in a sequence. Starting from this sequence, we repeatedly compress it. Each compression step takes every adjacent pair and replaces it with their Lowest Common Ancestor in the tree.
codeforces competitive-programming Jun 18, 2026
Practice › Codeforces Solutions › CUET Inter University Programming Contest 2025 ›

CF 106259K - The Great Withering

We are working with a tree where each edge is assigned an integer weight between 1 and $m$, independently for every edge. After fixing these weights, we perform a process that repeatedly removes nodes one by one. At each step, we pick any remaining node $u$.
codeforces competitive-programming Jun 18, 2026
Practice › Codeforces Solutions › CUET Inter University Programming Contest 2025 ›

CF 106259J - The Power of the Sun

We are given an array of integers representing energy levels in a line of fusion cores. Over time, we perform two kinds of range operations. One operation transforms every value in a segment into its factorial, replacing each element independently.
codeforces competitive-programming Jun 18, 2026
Practice › Codeforces Solutions › CUET Inter University Programming Contest 2025 ›

CF 106259H - Prime Triangles

We are asked to build a geometric construction for each test case: we must output a set of lattice points, and then specify $n$ triangles formed from those points.
codeforces competitive-programming Jun 18, 2026
Practice › Codeforces Solutions › CUET Inter University Programming Contest 2025 ›

CF 106259F - Survival of the Fated

We are given several independent test cases. In each one, a group of gladiators starts in a pool, each labeled with a strength value.
codeforces competitive-programming Jun 18, 2026
Practice › Codeforces Solutions › CUET Inter University Programming Contest 2025 ›

CF 106259E - A Slice of Pi

We are given points inside a circle centered at the origin. Each point represents a topping and has a numeric value that can be positive or negative.
codeforces competitive-programming Jun 18, 2026
Practice › Codeforces Solutions › CUET Inter University Programming Contest 2025 ›

CF 106259D - The AND, The OR, and The XOR

We are given an array of integers, and we need to pick a subsequence of length at least two. For any chosen subsequence, we compute two bitwise aggregates: the bitwise AND of all selected numbers and the bitwise OR of all selected numbers.
codeforces competitive-programming Jun 18, 2026
Practice › Codeforces Solutions › CUET Inter University Programming Contest 2025 ›

CF 106259A - Kill Two Birds with One Stone

We are given a grid where every cell starts with value 1, except for exactly two special cells that start at 0. The only allowed operation always picks two neighboring cells that share an edge, and subtracts 1 from both of them.
codeforces competitive-programming Jun 18, 2026