MITIT Spring 2025 Finals Round

5 problems from MITIT Spring 2025 Finals Round (contest 105870), difficulty -. 5/5 solutions verified against sample I/O.

5 items

MITIT Spring 2025 Finals Round

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

#	Problem	Time	✓
A	Beautiful Bracelets	49s	✓
B	Mashup	47s	✓
C	Escape Room	1m 3s	✓
D	Scary Subsequences	52s	✓
E	Polynomial Equation	1m 5s	✓

Practice › Codeforces Solutions › MITIT Spring 2025 Finals Round ›

CF 105870B - Mashup

We are given a collection of contests. Each contest contains a fixed number of problems, and every problem has a difficulty label in a small range from 1 to K.

Practice › Codeforces Solutions › MITIT Spring 2025 Finals Round ›

CF 105870E - Polynomial Equation

We are given a structured polynomial identity involving two variables $x, y$ over a finite field. The core object is a bivariate polynomial $P(x,y)$, but it is not arbitrary.

Practice › Codeforces Solutions › MITIT Spring 2025 Finals Round ›

CF 105870D - Scary Subsequences

We are given three fixed strings over a small alphabet, and we treat them as reference sequences that define which subsequences are “available” in a constrained sense.

Practice › Codeforces Solutions › MITIT Spring 2025 Finals Round ›

CF 105870A - Beautiful Bracelets

We are given an array of integers representing colored beads. From this array we construct two related sequences and then compare them in a cyclic way, meaning we are allowed to rotate one of them before comparing.

Practice › Codeforces Solutions › MITIT Spring 2025 Finals Round ›

CF 105870C - Escape Room

We are given a universe of K keys, and a family of subsets F of these keys. Each subset A represents the set of keys that are currently usable in a maze.