MITIT Winter 2025-26 Beginner Round

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

9 items

MITIT Winter 2025-26 Beginner Round

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

#	Problem	Time	✓
A	M	47s	✓
B	P=NP	33s	✓
C	Marbles	52s	✓
D	Introduction to Number Theory	44s	✓
E	67	54s	✓
F	Avoid Copyright Infringement	47s	✓
G	Busy Beaver's Faulty Machine	56s	✓
H	Exam Room	54s	✓
I	Mahjong Connect	1m 4s	✓

Practice › Codeforces Solutions › MITIT Winter 2025-26 Beginner Round ›

CF 106251G - Busy Beaver's Faulty Machine

We are given a positive integer $X$ written in base $B$ as a sequence of digits. The task is to determine whether there exist two positive integers $Y$ and $Z$ such that: $$X + Y = Z$$ and the base-$B$ representations of $Y$ and $Z$ contain exactly the same multiset of digits.

Practice › Codeforces Solutions › MITIT Winter 2025-26 Beginner Round ›

CF 106251B - P=NP

The problem describes a complete binary tree of tasks. The tree has a given height, and initially only the root task is available. There are p processors. During one unit of time, every processor can complete at most one currently available task.

Practice › Codeforces Solutions › MITIT Winter 2025-26 Beginner Round ›

CF 106251D - Introduction to Number Theory

We are given an array of integers, and we want to determine whether there exists a special value $X$ such that the array can be split into two groups with a very strong number-theoretic relationship to $X$.

Practice › Codeforces Solutions › MITIT Winter 2025-26 Beginner Round ›

CF 106251E - 67

We are dealing with an array of unknown positive integers where every pair of distinct elements is coprime. The only way we are allowed to interact with this array is through queries that return the product of two positions.

Practice › Codeforces Solutions › MITIT Winter 2025-26 Beginner Round ›

CF 106251H - Exam Room

We are given a set of points in the plane, and we want to count subsets of these points that satisfy a geometric restriction involving the origin.

Practice › Codeforces Solutions › MITIT Winter 2025-26 Beginner Round ›

CF 106251C - Marbles

We are given a permutation on the integers from 1 to n, meaning every position points to exactly one other position, and every position is pointed to exactly once.

Practice › Codeforces Solutions › MITIT Winter 2025-26 Beginner Round ›

CF 106251I - Mahjong Connect

The task is to determine whether a set of tiles on an $N times N$ grid can be completely paired under a specific connectivity rule, and if so, produce such a pairing.

Practice › Codeforces Solutions › MITIT Winter 2025-26 Beginner Round ›

CF 106251F - Avoid Copyright Infringement

We are asked to construct a string under strict composition constraints. The string is formed from three characters, which we can think of as three types of symbols, say M, T, and I.

Practice › Codeforces Solutions › MITIT Winter 2025-26 Beginner Round ›

CF 106251A - M

The task describes constructing a visual pattern inside an $N times N$ grid. Every cell initially contains a dot character, and then specific cells are overwritten with hash characters to form a symmetric drawing. The drawing consists of four independent components.