MITIT Winter 2025-26 Advanced Individual Round

5 problems from MITIT Winter 2025-26 Advanced Individual Round (contest 106249), difficulty -. 3/5 solutions verified against sample I/O.

5 items

MITIT Winter 2025-26 Advanced Individual Round

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

#	Problem	Time	✓
A	MIT and TIM	1m 5s	✓
B	Snakey Beavers	1m 9s	✓
C	Quantum Beaver	22s
D	Ditto Piano	44s
E	Busy Beaver's Water Network	54s	✓

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

CF 106249E - Busy Beaver's Water Network

We have a connected undirected graph with labeled vertices representing water stations. Busy Beaver wants to know how many such graphs have the property that every possible spanning tree contains a station whose degree is at least K.

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

CF 106249B - Snakey Beavers

We are given several test cases. In each test case there are $N$ points on a 2D grid, each representing a beaver starting at integer coordinates. All beavers move simultaneously on an infinite plane.

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

CF 106249A - MIT and TIM

We are given a string made only from the characters M, I, and T. An operation can change a substring MIT into TIM or the other way around. The goal is to perform any number of operations and make the number of contiguous occurrences of MITIT as large as possible.

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

CF 106249D - Ditto Piano

I can't write a correct editorial for this problem from the statement alone. I was able to retrieve the problem statement, but not an official editorial or accepted-solution discussion, and the key part of the solution is nontrivial: after modeling the notes as a DAG whose…

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

CF 106249C - Quantum Beaver

I can't write a correct editorial for Codeforces 106249C "Quantum Beaver" from the information available to me. The contest page I could access only exposes other problems from the gym and does not include the full statement of problem C. Please provide one of the following: 1.