2025 Winter ESCOM Training Camp, Final Contest

12 problems from 2025 Winter ESCOM Training Camp, Final Contest (contest 105858), difficulty -. 3/12 solutions verified against sample I/O.

12 items

2025 Winter ESCOM Training Camp, Final Contest

Special | 12 problems | 3/12 verified | Difficulty - | 6m 22s

#	Problem	Time	✓
A	Alternating Signs	54s	✓
B	Collecting Cards	31s
C	Iv\u00e1n Gives a Riddle	29s
D	Alice Based	29s
E	Generalized Sierpi\u0144ski Carpet	45s	✓
F	Dance of Ferrets 2	25s
G	Christmas Present	25s
H	One Two-One Chips (Extreme version)	23s
I	Mine sweeper	24s
J	Leo's Daily Training	27s
K	Darkness Rise	28s
L	Everyone loves k shortest path problems!	42s	✓

Practice › Codeforces Solutions › 2025 Winter ESCOM Training Camp, Final Contest ›

CF 105858L - Everyone loves k shortest path problems!

We have n souvenirs. Each souvenir must be assigned to exactly one of two friends. If souvenir i goes to the first friend, it contributes ai happiness to the first friend and nothing to the second. If it goes to the second friend, the opposite happens with value bi.

Practice › Codeforces Solutions › 2025 Winter ESCOM Training Camp, Final Contest ›

CF 105858K - Darkness Rise

I can’t write a correct editorial yet because the actual problem statement for Codeforces 105858K - Darkness Rise isn’t included in your prompt. Right now I don’t know what the input represents, what needs to be computed, or what constraints drive the solution.

Practice › Codeforces Solutions › 2025 Winter ESCOM Training Camp, Final Contest ›

CF 105858J - Leo's Daily Training

The problem statement section is empty, so there isn’t enough information to write a correct editorial. Codeforces problems are highly specific, and without the actual statement (inputs, outputs, constraints, and what “Leo’s Daily Training” is asking), any solution would…

Practice › Codeforces Solutions › 2025 Winter ESCOM Training Camp, Final Contest ›

CF 105858I - Mine sweeper

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

Practice › Codeforces Solutions › 2025 Winter ESCOM Training Camp, Final Contest ›

CF 105858H - One Two-One Chips (Extreme version)

I can’t write a correct editorial for this yet because the actual problem statement is missing from your prompt. “Codeforces 105858H - One Two-One Chips (Extreme version)” is referenced, but there are no details about the rules, input format, or what needs to be computed.

Practice › Codeforces Solutions › 2025 Winter ESCOM Training Camp, Final Contest ›

CF 105858G - Christmas Present

I can absolutely write that editorial, but the problem statement section you provided is empty. For Codeforces 105858G - Christmas Present, I need at least the actual problem description (or a link / pasted statement) to: - understand what is being computed, - derive the…

Practice › Codeforces Solutions › 2025 Winter ESCOM Training Camp, Final Contest ›

CF 105858F - Dance of Ferrets 2

I can write the full editorial, but I need the actual problem statement or a link/details for Codeforces 105858F - Dance of Ferrets 2 first.

Practice › Codeforces Solutions › 2025 Winter ESCOM Training Camp, Final Contest ›

CF 105858E - Generalized Sierpiński Carpet

The problem defines a two-dimensional fractal pattern on an infinite grid, constructed by repeatedly subdividing the plane into equal square blocks and removing a specific region in the middle at every scale.

Practice › Codeforces Solutions › 2025 Winter ESCOM Training Camp, Final Contest ›

CF 105858D - Alice Based

I can’t reliably write a correct editorial yet because the actual problem “Codeforces 105858D - Alice Based” is not accessible from standard archives or the contest index, and there is no statement content available in your prompt.

Practice › Codeforces Solutions › 2025 Winter ESCOM Training Camp, Final Contest ›

CF 105858A - Alternating Signs

We are given an array of non-zero integers. We need to choose a subsequence, meaning we keep some elements in their original order and discard the rest.

Practice › Codeforces Solutions › 2025 Winter ESCOM Training Camp, Final Contest ›

CF 105858B - Collecting Cards

I cannot reliably identify “Codeforces 105858B - Collecting Cards” from the usual CF archive or public mirror listings, and the ID format suggests it may come from a Gym, a private contest archive, or a problemset migration where the canonical statement is not directly…

Practice › Codeforces Solutions › 2025 Winter ESCOM Training Camp, Final Contest ›

CF 105858C - Iván Gives a Riddle

You are absolutely right to pause here: the full editorial cannot be written correctly without the actual problem statement, and for this Codeforces problem the statement is not included in your prompt.