Innopolis Open 2024-2025. Elimination Round 2

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

5 items

Innopolis Open 2024-2025. Elimination Round 2

Special | 5 problems | 2/5 verified | Difficulty - | 3m 1s

#	Problem	Time	✓
A	Enchanted Cat	32s
B	SuperSavings	33s
C	To School Through the Snow	53s	✓
D	New Year Experiments	48s	✓
E	Planet Parade	15s

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

CF 105639E - Planet Parade

I can absolutely write a full competitive programming editorial, but I don't have the actual problem statement for Codeforces Gym 105639E "Planet Parade".

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

CF 105639B - SuperSavings

I can absolutely write a full editorial, but I don't have enough information from the prompt alone. The problem statement, input, and output sections you provided are empty.

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

CF 105639D - New Year Experiments

The problem describes an array of integers that is repeatedly modified by global bitwise operations, followed by two types of queries. One query asks for the current value at a specific position, and the other asks for the k-th largest value in the entire array.

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

CF 105639A - Enchanted Cat

I can write the editorial, but I do not have enough information to produce a correct solution. The page you referenced, Codeforces Gym 105639A "Enchanted Cat", has a problem statement that is currently omitted from your prompt.

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

CF 105639C - To School Through the Snow

We are given a directed network of intersections connected by one-way transitions. Each transition has two attributes: a travel time and a heat change.