MITIT Winter 2025-26 Advanced Team Round

9 problems from MITIT Winter 2025-26 Advanced Team Round (contest 106250), difficulty -. 9/9 solutions verified against sample I/O.

9 items

MITIT Winter 2025-26 Advanced Team Round

Special | 9 problems | 9/9 verified | Difficulty - | 7m 47s

#	Problem	Time	✓
A	67	52s	✓
B	Avoid Copyright Infringement	1m 4s	✓
C	Busy Beaver's Faulty Machine	53s	✓
D	Exam Room	51s	✓
E	Mahjong Connect	55s	✓
F	Collatz Conjecture	45s	✓
G	Busy Beaver's Dam Logs	53s	✓
H	Snacks Scheduling	49s	✓
I	RMQ	45s	✓

Practice › Codeforces Solutions › MITIT Winter 2025-26 Advanced Team Round ›

CF 106250G - Busy Beaver's Dam Logs

We maintain an array whose elements are always in the range [-2, 2]. Two kinds of operations appear. An update changes one position to a new value. A query gives a nonzero target sum X. We must determine whether there exists a contiguous subarray whose sum is exactly X.

Practice › Codeforces Solutions › MITIT Winter 2025-26 Advanced Team Round ›

CF 106250A - 67

We are working with an unknown array of positive integers indexed from 1 to N. A key structural promise is that any two different elements of this array are coprime, so their greatest common divisor is always 1.

Practice › Codeforces Solutions › MITIT Winter 2025-26 Advanced Team Round ›

CF 106250H - Snacks Scheduling

We are given an array of length $N$, where each position $i$ is associated with a forbidden value $Ai$. The task is to construct a permutation $P$ of numbers $1$ to $N$ such that no position matches its forbidden value, meaning $Pi ne Ai$ for every index $i$.

Practice › Codeforces Solutions › MITIT Winter 2025-26 Advanced Team Round ›

CF 106250B - Avoid Copyright Infringement

We are given a target multiset of three types of characters, which we can think of as a string construction problem over the alphabet {M, T, I}. The input specifies how many times each character must appear in the final string.

Practice › Codeforces Solutions › MITIT Winter 2025-26 Advanced Team Round ›

CF 106250E - Mahjong Connect

We are given a set of Mahjong tiles placed on a grid after discretization, so every tile lies on integer coordinates within an $N times N$ board.

Practice › Codeforces Solutions › MITIT Winter 2025-26 Advanced Team Round ›

CF 106250D - Exam Room

We are given a set of points in the plane with a fixed origin point $O$. The task is to count how many subsets of these points are “valid” under a geometric constraint that depends on distances and angles relative to $O$.

Practice › Codeforces Solutions › MITIT Winter 2025-26 Advanced Team Round ›

CF 106250I - RMQ

We are working with a procedure over an array where the core operation is repeatedly locating range minima and splitting the array around them, similar in spirit to building a Cartesian tree.

Practice › Codeforces Solutions › MITIT Winter 2025-26 Advanced Team Round ›

CF 106250F - Collatz Conjecture

We are given an array, and each element generates a deterministic sequence derived from the Collatz process. Instead of working with the raw numbers, we care about the parity pattern along each generated sequence. Every term is encoded as either +1 for even or −1 for odd.

Practice › Codeforces Solutions › MITIT Winter 2025-26 Advanced Team Round ›

CF 106250C - Busy Beaver's Faulty Machine

We are given several independent test cases. In each test case there is a multiset of positive integers placed on a board.