Innopolis Open 2025-2026. Elimination Round 2

5 problems from Innopolis Open 2025-2026. Elimination Round 2 (contest 106292), difficulty -. 5/5 solutions verified against sample I/O.

5 items

Innopolis Open 2025-2026. Elimination Round 2

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

#	Problem	Time	✓
A	Non-trivial Energy of Crystals	50s	✓
B	Selling Apartments	1m	✓
C	Arseniy's Problem	54s	✓
D	Elephant Filimon and the Digit Three	1m 3s	✓
E	Shustrik and Boxes	1m 5s	✓

Practice › Codeforces Solutions › Innopolis Open 2025-2026. Elimination Round 2 ›

CF 106292D - Elephant Filimon and the Digit Three

We are given a number and allowed to repeatedly modify it using a very specific operation. In one move, we pick any positive integer whose decimal form is made only of the digit 3, such as 3, 33, 333, and so on, and add it to the current value.

Practice › Codeforces Solutions › Innopolis Open 2025-2026. Elimination Round 2 ›

CF 106292B - Selling Apartments

We are given a list of apartments, each with a selling price and a district label. Time is divided into t days, and on each day Boris can sell at most one apartment or do nothing.

Practice › Codeforces Solutions › Innopolis Open 2025-2026. Elimination Round 2 ›

CF 106292E - Shustrik and Boxes

We are given a rooted tree of boxes. Box 1 is the root, and every other box is placed inside exactly one parent box, so each box defines a subtree of boxes under it. Each box also contains a list of edges over a shared global set of vertices.

Practice › Codeforces Solutions › Innopolis Open 2025-2026. Elimination Round 2 ›

CF 106292C - Arseniy's Problem

We are asked to construct the smallest possible n-digit number $x$ such that there are at least $k$ different n-digit numbers that are less than or equal to $x$ and all share the same sum of digits as $x$.

Practice › Codeforces Solutions › Innopolis Open 2025-2026. Elimination Round 2 ›

CF 106292A - Non-trivial Energy of Crystals

We are given a multiset of integers, each representing an energy value of a crystal. The task is to split all crystals into two groups such that no pair of crystals inside the same group has a sum that is a prime number.