2025 GUC Winter Camp

15 problems from 2025 GUC Winter Camp (contest 106241), difficulty -. 15/15 solutions verified against sample I/O.

15 items

2025 GUC Winter Camp

Special | 15 problems | 15/15 verified | Difficulty - | 13m 45s

# Problem Rating Tags Accepted Time ✓
A Ya Sabah El GCD 56s ✓
B Bouncing Chaos 1m ✓
C Shift And Think 58s ✓
D Mini-Max Permutation 1m 4s ✓
E Sheesh El Beesh 59s ✓
F GCD <-> LCM 52s ✓
G Journey Around The World 54s ✓
H Yasser and Arithmetic Sequences 49s ✓
I Er7am El Tree 1m 2s ✓
J 7aseb El Triangle 56s ✓
K Good Subarrays 55s ✓
L Extended Modulo Queries 50s ✓
M Ultimate K-Query 57s ✓
N Ma3rofa 2lsra7a 49s ✓
O Ya Masa2 El Geometry 44s ✓
Practice › Codeforces Solutions › 2025 GUC Winter Camp ›

CF 106241L - Extended Modulo Queries

We are given an array of integers where both the array values and the modulus values are bounded by 50,000. Each query does not ask for a single computation, but for a nested sum: we pick a segment of the array and then, for every modulus value in a given range, we compute the…
codeforces competitive-programming Jun 20, 2026
Practice › Codeforces Solutions › 2025 GUC Winter Camp ›

CF 106241O - Ya Masa2 El Geometry

We are given a set of points on a plane, and the task is to cover all of them using at most two circles. Each circle can be placed anywhere and can have any radius, including zero.
codeforces competitive-programming Jun 20, 2026
Practice › Codeforces Solutions › 2025 GUC Winter Camp ›

CF 106241G - Journey Around The World

We are given a nearly complete undirected graph on $n$ cities. Originally, every pair of cities had a road, so the graph was a clique. Then a small number of edges, at most 200, were removed.
codeforces competitive-programming Jun 20, 2026
Practice › Codeforces Solutions › 2025 GUC Winter Camp ›

CF 106241D - Mini-Max Permutation

We are asked to construct a permutation of the integers from 1 to n. For every subarray of this permutation, we compute a value that depends on how spread out the numbers are inside it. Specifically, for a segment p[i..
codeforces competitive-programming Jun 20, 2026
Practice › Codeforces Solutions › 2025 GUC Winter Camp ›

CF 106241I - Er7am El Tree

We are given a tree with values written on its nodes, and a fixed ordering of its edges as they were “laid on the ground”.
codeforces competitive-programming Jun 19, 2026
Practice › Codeforces Solutions › 2025 GUC Winter Camp ›

CF 106241K - Good Subarrays

We are given an array of distinct integers. The task is not to modify the array itself, but to count how many contiguous subarrays have a special property.
codeforces competitive-programming Jun 19, 2026
Practice › Codeforces Solutions › 2025 GUC Winter Camp ›

CF 106241E - Sheesh El Beesh

We are given a row of dominoes, each with a height and a cost. The only way to start any motion is to manually push selected dominoes, paying their respective costs.
codeforces competitive-programming Jun 19, 2026
Practice › Codeforces Solutions › 2025 GUC Winter Camp ›

CF 106241C - Shift And Think

We are given a permutation p of size n, meaning it is a rearrangement of the numbers from 1 to n. Think of p as a function from indices to indices, where from position i you jump to position p[i]. A key operation is shifting the permutation cyclically to the left.
codeforces competitive-programming Jun 19, 2026
Practice › Codeforces Solutions › 2025 GUC Winter Camp ›

CF 106241M - Ultimate K-Query

We are given an array of length n, and we need to answer q queries. Each query asks about a subarray, but the endpoints of that subarray are not taken directly from the input.
codeforces competitive-programming Jun 19, 2026
Practice › Codeforces Solutions › 2025 GUC Winter Camp ›

CF 106241H - Yasser and Arithmetic Sequences

We are given an array and we are allowed to slightly adjust each element, but only once per position, and the adjustment is extremely limited: for each index we can either do nothing or add/subtract an integer between 1 and 10.
codeforces competitive-programming Jun 19, 2026
Practice › Codeforces Solutions › 2025 GUC Winter Camp ›

CF 106241B - Bouncing Chaos

We are simulating two identical billiard balls moving inside a rectangular grid of size $n times m$. Each cell has integer coordinates $(i, j)$, and both balls start from interior positions, never on the boundary.
codeforces competitive-programming Jun 19, 2026
Practice › Codeforces Solutions › 2025 GUC Winter Camp ›

CF 106241N - Ma3rofa 2lsra7a

We are given a single integer $x$, and we want to know whether it can be split into three perfect squares of positive integers.
codeforces competitive-programming Jun 19, 2026
Practice › Codeforces Solutions › 2025 GUC Winter Camp ›

CF 106241J - 7aseb El Triangle

We are given a geometric configuration built on a straight baseline. Three points lie on one line in the order B, C, D, with the segment from B to C having the same length as the segment from C to D.
codeforces competitive-programming Jun 19, 2026
Practice › Codeforces Solutions › 2025 GUC Winter Camp ›

CF 106241F - GCD <-> LCM

We are given an array of integers and we need to count how many ordered quadruples of indices $(i, j, k, l)$ satisfy a very specific equality between two number-theoretic expressions.
codeforces competitive-programming Jun 19, 2026
Practice › Codeforces Solutions › 2025 GUC Winter Camp ›

CF 106241A - Ya Sabah El GCD

We are given two arrays of equal length. At every position, we are allowed to optionally “upgrade” the value in the first array by replacing it with the gcd of that value and the corresponding value in the second array.
codeforces competitive-programming Jun 19, 2026