UTPC Contest 1-29-25 Div. 2 (Beginner)

8 problems from UTPC Contest 1-29-25 Div. 2 (Beginner) (contest 105689), difficulty -. 2/8 solutions verified against sample I/O.

8 items

UTPC Contest 1-29-25 Div. 2 (Beginner)

Div. 2 | 8 problems | 2/8 verified | Difficulty - | 4m 19s

#	Problem	Time	✓
A	Moon Spotting	31s
B	Snake Years	32s
C	Dragon Dance	43s	✓
D	Lion Dancers	22s
E	Lunar Phases	29s
F	Lantern Hopping	50s	✓
G	Dragon Scales	26s
H	Sally's Stroll (Easy Version)	26s

Practice › Codeforces Solutions › UTPC Contest 1-29-25 Div. 2 (Beginner) ›

CF 105689F - Lantern Hopping

The festival contains a line of lanterns, and each lantern has a current height. The dragon starts on one chosen lantern and wants to eventually stand on every lantern. A hop is only possible between neighboring lanterns when their heights match at that moment.

Practice › Codeforces Solutions › UTPC Contest 1-29-25 Div. 2 (Beginner) ›

CF 105689H - Sally's Stroll (Easy Version)

The problem statement is missing from your prompt (the sections for description, input, and output are empty), so there isn’t enough information to reconstruct the task or derive any algorithm.

Practice › Codeforces Solutions › UTPC Contest 1-29-25 Div. 2 (Beginner) ›

CF 105689G - Dragon Scales

I can’t produce a correct editorial for this yet because the actual problem statement is missing from your prompt.

Practice › Codeforces Solutions › UTPC Contest 1-29-25 Div. 2 (Beginner) ›

CF 105689E - Lunar Phases

I can’t write a correct editorial for Codeforces 105689E - Lunar Phases because the actual problem statement (what is being computed, input/output format, constraints, and rules) is missing.

Practice › Codeforces Solutions › UTPC Contest 1-29-25 Div. 2 (Beginner) ›

CF 105689D - Lion Dancers

Something went wrong while generating the response. If this issue persists please contact us through our help center at [help.openai.com](https://help.openai.com/).

Practice › Codeforces Solutions › UTPC Contest 1-29-25 Div. 2 (Beginner) ›

CF 105689C - Dragon Dance

The line of dragon dancers already has a fixed order. James may remove some dancers, but the dancers that remain must still respect the original “who stands behind whom” relationships.

Practice › Codeforces Solutions › UTPC Contest 1-29-25 Div. 2 (Beginner) ›

CF 105689B - Snake Years

The problem statement is missing, so there’s no way to reconstruct the actual task for “105689B - Snake Years” reliably. For a Codeforces editorial, even small details like input format or what “snake years” refers to completely determine the algorithm.

Practice › Codeforces Solutions › UTPC Contest 1-29-25 Div. 2 (Beginner) ›

CF 105689A - Moon Spotting

I can’t produce a correct editorial for this yet because the actual problem statement for Codeforces 105689A - Moon Spotting isn’t included.