MITIT Spring 2026 Invitationals Qualification Round 1

5 problems from MITIT Spring 2026 Invitationals Qualification Round 1 (contest 106429), difficulty -. 5/5 solutions verified against sample I/O.

5 items

MITIT Spring 2026 Invitationals Qualification Round 1

Special | 5 problems | 5/5 verified | Difficulty - | 4m 14s

#	Problem	Time	✓
A	Tart Splitting	40s	✓
B	Orange Pit	49s	✓
C	Carrot Party	46s	✓
D	Binary Beaver	1m 5s	✓
E	Snake	54s	✓

Practice › Codeforces Solutions › MITIT Spring 2026 Invitationals Qualification Round 1 ›

CF 106429A - Tart Splitting

We are given a string representing a circular arrangement of elements, and another string representing a target pattern. The task is to determine whether the target pattern can be obtained by rotating the original circular arrangement.

Practice › Codeforces Solutions › MITIT Spring 2026 Invitationals Qualification Round 1 ›

CF 106429C - Carrot Party

We are given a sequence of numbers representing a game where two players alternately remove elements from a line.

Practice › Codeforces Solutions › MITIT Spring 2026 Invitationals Qualification Round 1 ›

CF 106429E - Snake

We are simulating a process where a snake moves through a fixed sequence of cells over time. At each time step $t$, the head of the snake occupies a known cell $c(t)$. Some cells may repeat over time, meaning the snake can revisit the same position later.

Practice › Codeforces Solutions › MITIT Spring 2026 Invitationals Qualification Round 1 ›

CF 106429D - Binary Beaver

We are given a multiset of integers, each represented in binary using a fixed number of bits. For any candidate integer $x$, we define its score as the total sum, over all array elements $ai$, of the number of matching lowest-order bits between $x$ and $ai$.

Practice › Codeforces Solutions › MITIT Spring 2026 Invitationals Qualification Round 1 ›

CF 106429B - Orange Pit

We are given a multiset of integer labels representing oranges. After sorting these labels, we obtain an ordered sequence $b1 le b2 le dots le bn$.