Petrozavodsk Summer Camp 2025. Day 6. Xeppelin Contest The 4rd Universal Cup. Stage 2: Grand Prix of Paris)
13 problems from Petrozavodsk Summer Camp 2025. Day 6. Xeppelin Contest The 4rd Universal Cup. Stage 2: Grand Prix of Paris) (contest 106182), difficulty -. 6/13 solutions verified against sample I/O.
Petrozavodsk Summer Camp 2025. Day 6. Xeppelin Contest The 4rd Universal Cup. Stage 2: Grand Prix of Paris)
Special | 13 problems | 6/13 verified | Difficulty - | 8m 42s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | Apple Tree | 27s | ||||
| B | Balatro | 45s | ✓ | |||
| C | Classement Nationale | 50s | ✓ | |||
| D | Digit Division | 32s | ✓ | |||
| E | Euclid in Manhattan | 51s | ||||
| F | Framboise 2 | 26s | ||||
| G | Goofy Songs | 37s | ✓ | |||
| H | Heure de Rush | 23s | ||||
| I | Infrared | 25s | ||||
| J | JamBrains | 1m 14s | ||||
| K | $k$ Operations | 1m 1s | ✓ | |||
| L | Lice Hopping | 35s | ✓ | |||
| M | Manhattan Graph | 36s |
CF 106182M - Manhattan Graph
I can write this editorial, but I need the exact official solution details first. The problem statement alone is not enough to safely derive the intended construction, and I do not want to provide a plausible-looking but incorrect editorial for a hard graph embedding problem.
CF 106182J - JamBrains
I’m sorry, but I can’t provide a complete editorial and implementation for this problem from the information available here without risking inventing an incorrect solution.
CF 106182K - $k$ Operations
We are given a sequence of positive integers. We are allowed to choose a value of $k$, and then repeatedly apply an operation that picks exactly $k$ positions in the array and multiplies all chosen elements by the same non-zero integer.
CF 106182L - Lice Hopping
The room is modeled as a tree, where every person is a vertex and two people are connected if the lice can move directly between them in one day of training. After training for d days, the lice can jump between any two vertices whose tree distance is at most d.
CF 106182I - Infrared
following your requested style and formatting exactly.
CF 106182H - Heure de Rush
I need to be upfront about a limitation here: the actual statement of Codeforces 106182H - Heure de Rush is not available in the prompt, and it also does not appear in accessible public mirrors in a way that can be reliably reconstructed from surrounding metadata alone.
CF 106182E - Euclid in Manhattan
Codeforces 106182E: Euclid in Manhattan
CF 106182G - Goofy Songs
The input is a piece of text split into lines. A valid song is built from repeating a two-line pattern based on one chosen lowercase word S.
CF 106182F - Framboise 2
I can’t reliably reconstruct Codeforces 106182F “Framboise 2” from just the title, and the editorial depends completely on the actual problem mechanics.
CF 106182D - Digit Division
The task is to split a string of digits into consecutive pieces so that the pieces, when interpreted as integers, form a strictly increasing sequence. We need to create at least two pieces, and the order of digits cannot change. If a valid split exists, we output any one of them.
CF 106182C - Classement Nationale
The problem models a national ranking system for athletes where each athlete’s rating evolves over time based on race results and past performance. Each athlete starts with a base rating, and then multiple competitions occur in chronological order.
CF 106182B - Balatro
The problem gives a collection of cards. Each card has two values, a and b. We must choose exactly k cards and maximize the product of the sum of all chosen a values and the sum of all chosen b values.
CF 106182A - Apple Tree
I can write the full editorial, but I’m missing the actual problem details. “Codeforces 106182A - Apple Tree” does not uniquely identify a standard Codeforces problem from the information provided, and the statement/input/output sections in your prompt are empty.