IPL 2026

16 problems from IPL 2026 (contest 106501), difficulty -. 9/16 solutions verified against sample I/O.

16 items

IPL 2026

Special | 16 problems | 9/16 verified | Difficulty - | 11m 16s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Colors				49s	✓
B	Range Information				1m	✓
C	Zigzag Sort				29s
D	Evenly Separable				31s	✓
E	Min Nim				32s
F	Auchenai's Letter Game				27s
G	LCM Matrix				42s	✓
H	Maka				20s
I	Shift or Remove				1m 29s
J	Tournament Transformation				1m 2s	✓
K	Nondecreasing Queries				25s
L	Avoid Square Sums				1m 22s	✓
W	Cactus Constructive				38s	✓
X	Shortest Travel				18s
Y	Grocery shopping				37s	✓
Z	Nonexistent				35s	✓

Practice › Codeforces Solutions › IPL 2026 ›

CF 106501Z - Nonexistent

The task is defined in a way that effectively gives no meaningful structure to process. There is no concrete input specification to interpret as data, and no transformation rule that maps an input to an output.

Practice › Codeforces Solutions › IPL 2026 ›

CF 106501Y - Grocery shopping

The problem asks us to schedule a visit to every shop as quickly as possible. There are only a small number of shops, but each shop can have many other customers arriving over time.

Practice › Codeforces Solutions › IPL 2026 ›

CF 106501L - Avoid Square Sums

We need construct a set of n different positive integers. Every chosen value must stay in the range from 1 to 100000. The condition is that if we take any non-empty group of at most eight chosen numbers, the sum of that group must not be a perfect square.

Practice › Codeforces Solutions › IPL 2026 ›

CF 106501W - Cactus Constructive

We are given three integers that represent target distances on a tree. The task is to construct any tree such that if we look at all unordered pairs of vertices, the number of pairs whose shortest path length equals each of the three given distances is strictly positive and…

Practice › Codeforces Solutions › IPL 2026 ›

CF 106501X - Shortest Travel

I can write the full editorial in that format, but I do not have enough information to determine the actual problem.

Practice › Codeforces Solutions › IPL 2026 ›

CF 106501I - Shift or Remove

I can write the editorial, but the full requested format is much longer than a single response can fit while still keeping the explanation and code complete.

Practice › Codeforces Solutions › IPL 2026 ›

CF 106501J - Tournament Transformation

We are given two complete directed graphs on the same set of vertices, meaning for every pair of distinct vertices exactly one direction of the edge exists. These are usually called tournaments.

Practice › Codeforces Solutions › IPL 2026 ›

CF 106501K - Nondecreasing Queries

Sure. Please provide the Codeforces problem statement (or link, title, constraints, and examples), and I’ll write a detailed competitive programming editorial covering: - Problem restatement - Key observations / intuition - Derivation of the algorithm - Proof of correctness…

Practice › Codeforces Solutions › IPL 2026 ›

CF 106501G - LCM Matrix

The matrix is not arbitrary. Each row has a hidden value and each column has a hidden value, and every visible cell is the least common multiple of those two values.

Practice › Codeforces Solutions › IPL 2026 ›

CF 106501H - Maka

I can’t reliably write a correct Codeforces-style editorial for 106501H - Maka because the problem statement is missing from your prompt.

Practice › Codeforces Solutions › IPL 2026 ›

CF 106501F - Auchenai's Letter Game

I can write the full editorial, but I need the actual problem statement for Codeforces 106501F first. I could not reliably identify “Auchenai's Letter Game” from the problem ID and title alone, and the statement fields in your prompt are empty.

Practice › Codeforces Solutions › IPL 2026 ›

CF 106501E - Min Nim

I can write the full Codeforces-style editorial, but I don’t have the actual statement of Codeforces 106501E - Min Nim available from the prompt, and I can’t reliably reconstruct it without risking inventing the problem.

Practice › Codeforces Solutions › IPL 2026 ›

CF 106501B - Range Information

The problem maintains an array of large non-negative integers. For any value, a transformation f is defined by taking the sum of its decimal digits and removing the smallest digit among them.

Practice › Codeforces Solutions › IPL 2026 ›

CF 106501D - Evenly Separable

We have a row of tiles represented by an integer array b. We add the same non-negative value x to every tile. After this operation, we want the row to be splittable at some position between two tiles so that the sum on the left side equals the sum on the right side.

Practice › Codeforces Solutions › IPL 2026 ›

CF 106501A - Colors

We are given a tree where every node has two attributes: a color and a positive weight. We need to choose a set of vertices such that no two chosen vertices are connected by an edge, and at the same time no two chosen vertices share the same color.

Practice › Codeforces Solutions › IPL 2026 ›

CF 106501C - Zigzag Sort

I’ll make sure the explanation and code match the actual problem rather than guessing from the name.