MITIT Spring 2026 Invitationals Finals

5 problems from MITIT Spring 2026 Invitationals Finals (contest 106516), difficulty -. 5/5 solutions verified against sample I/O.

5 items

MITIT Spring 2026 Invitationals Finals

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

#	Problem	Time	✓
A	Edit Distance Parity	1m 2s	✓
B	Fruit Blast	58s	✓
C	Tree Partition	55s	✓
D	Sell in Pairs	56s	✓
E	Planar Exact Cover	55s	✓

Practice › Codeforces Solutions › MITIT Spring 2026 Invitationals Finals ›

CF 106516E - Planar Exact Cover

We are given a planar graph that comes from a very structured combinatorial construction. Each vertex is constrained to behave in one of two ways. One type of vertex behaves like a “one-in” node: among all incident edges, exactly one edge must be oriented inward.

Practice › Codeforces Solutions › MITIT Spring 2026 Invitationals Finals ›

CF 106516D - Sell in Pairs

We are given a sequence of counts indexed by position, where each position represents how many identical items of a certain “type” we have. The task is to repeatedly remove items in pairs, where each pair can either come from two adjacent positions or from the same position.

Practice › Codeforces Solutions › MITIT Spring 2026 Invitationals Finals ›

CF 106516A - Edit Distance Parity

We are given two sequences, one of length n and another of length m. The exact symbols in these sequences are unknown, but we are given enough information about how similar their prefixes are under the classic edit distance definition. The edit distance between prefixes a[1..

Practice › Codeforces Solutions › MITIT Spring 2026 Invitationals Finals ›

CF 106516B - Fruit Blast

We are given a long sequence whose length is $N^2$, and every value from $1$ to $N$ appears exactly $N$ times. The sequence is meant to be interpreted as a timeline of actions involving $N$ labeled tokens arranged in a cyclic structure.

Practice › Codeforces Solutions › MITIT Spring 2026 Invitationals Finals ›

CF 106516C - Tree Partition

We are given a tree, and we are asked to count how many ways we can decompose its vertex set into disjoint simple paths such that every path has length that is a power of two when measured in number of vertices.