2025 Taiwan NHSPC Mock Contest (Mirror)

9 problems from 2025 Taiwan NHSPC Mock Contest (Mirror) (contest 106242), difficulty -. 4/9 solutions verified against sample I/O.

9 items

2025 Taiwan NHSPC Mock Contest (Mirror)

Special | 9 problems | 4/9 verified | Difficulty - | 9m 46s

#	Problem	Time	✓
A	Finding Socks (socks)	39s	✓
B	Sushibwoah (sushi)	30s
C	Trees and Flowers (flower)	5m 20s
D	GL Convolution (gcdlcm)	48s	✓
E	K-th Unique Element (unique)	34s	✓
F	Root Distance Sum (rootsum)	24s
G	DVDlogo (dvdlogo)	51s	✓
H	Claire's Journey (wall)	21s
I	Another Construction Problem (construct)	19s

Practice › Codeforces Solutions › 2025 Taiwan NHSPC Mock Contest (Mirror) ›

CF 106242C - Trees and Flowers (flower)

Codeforces 106242C: Trees and Flowers (flower)

Practice › Codeforces Solutions › 2025 Taiwan NHSPC Mock Contest (Mirror) ›

CF 106242I - Another Construction Problem (construct)

I can’t produce a correct editorial yet because the actual statement of Codeforces 106242I - Another Construction Problem (construct) is not available in the prompt, and it is not identifiable from standard archives or the search results.

Practice › Codeforces Solutions › 2025 Taiwan NHSPC Mock Contest (Mirror) ›

CF 106242H - Claire's Journey (wall)

Got it. Please send the full Codeforces problem statement (or link/text + constraints), and I’ll write a complete competitive programming editorial for it-covering intuition, key observations, solution, complexity, and implementation details.

Practice › Codeforces Solutions › 2025 Taiwan NHSPC Mock Contest (Mirror) ›

CF 106242F - Root Distance Sum (rootsum)

I’m missing the actual problem statement (the section is blank in your prompt), so I can’t safely reconstruct what Codeforces 106242F - Root Distance Sum (rootsum) is asking.

Practice › Codeforces Solutions › 2025 Taiwan NHSPC Mock Contest (Mirror) ›

CF 106242D - GL Convolution (gcdlcm)

The task is to combine two sequences indexed by positive integers using a number-theoretic pairing rule based on gcd and lcm.

Practice › Codeforces Solutions › 2025 Taiwan NHSPC Mock Contest (Mirror) ›

CF 106242E - K-th Unique Element (unique)

We are given an array of integers and are allowed to change elements arbitrarily, with each change counting as one operation. The goal is to modify the array so that every contiguous segment of it contains at least one value that appears exactly once inside that segment.

Practice › Codeforces Solutions › 2025 Taiwan NHSPC Mock Contest (Mirror) ›

CF 106242A - Finding Socks (socks)

The process described is about a person who starts with a fixed number of socks and wears one pair per day. Each day consumes one pair permanently. On certain days, specifically every fixed interval of days, new socks are added, but they are only available starting the next day.

Practice › Codeforces Solutions › 2025 Taiwan NHSPC Mock Contest (Mirror) ›

CF 106242B - Sushibwoah (sushi)

I can’t reliably write a correct editorial yet because the full problem statement for Codeforces 106242B - Sushibwoah (sushi) is not accessible from the standard archive view, and the snippets available do not contain the actual rules of the task.

Practice › Codeforces Solutions › 2025 Taiwan NHSPC Mock Contest (Mirror) ›

CF 106242G - DVDlogo (dvdlogo)

We are dealing with a classic geometric simulation that behaves like a “DVD logo” bouncing inside a rectangular screen. A point moves in straight lines at a fixed diagonal direction.