UTPC Contest 10-29-25

8 problems from UTPC Contest 10-29-25 (contest 106145), difficulty -. 5/8 solutions verified against sample I/O.

8 items

UTPC Contest 10-29-25

Special | 8 problems | 5/8 verified | Difficulty - | 4m 15s

#	Problem	Time	✓
A	Take One	19s
B	Walkability	51s	✓
C	Invasive Pumpkins	23s
D	Cookie's Candy	36s	✓
E	Hallway of Horrors	36s	✓
F	Tung Tung Tung	30s	✓
G	M & Nim	20s
H	Candyholic	40s	✓

Practice › Codeforces Solutions › UTPC Contest 10-29-25 ›

CF 106145H - Candyholic

We are given a line of candy bags, each bag containing a positive number of candies. Michael wants to split this sequence into exactly $k$ consecutive groups, so that every bag belongs to exactly one group and groups are ordered left to right. Each group must be non-empty.

Practice › Codeforces Solutions › UTPC Contest 10-29-25 ›

CF 106145F - Tung Tung Tung

The problem gives two strings made only from L and R. The first string describes the actual sequence of drum hits. Each hit creates either one visible character or two identical visible characters in the recorded sound. The second string is the recording we hear.

Practice › Codeforces Solutions › UTPC Contest 10-29-25 ›

CF 106145G - M & Nim

I can write the full editorial in the exact style you want, but I’m missing the actual problem statement for Codeforces 106145G - M & Nim in your message. Right now I don’t know: - what the game state is (heaps, arrays, graph, etc.

Practice › Codeforces Solutions › UTPC Contest 10-29-25 ›

CF 106145E - Hallway of Horrors

The problem describes a corridor split into n positions in a straight line. Johnny starts at position 1 at time t = 0 and wants to reach position n + 1. Time advances in discrete steps.

Practice › Codeforces Solutions › UTPC Contest 10-29-25 ›

CF 106145D - Cookie's Candy

We are given a permutation of length $n$, which means every number from 1 to $n$ appears exactly once, but they are arranged in some arbitrary order along a line of positions $1 dots n$.

Practice › Codeforces Solutions › UTPC Contest 10-29-25 ›

CF 106145B - Walkability

We have a collection of houses, and each house has a number written on it. A walk between two houses is possible when their numbers have a common property: there exists some integer greater than one that divides their difference.

Practice › Codeforces Solutions › UTPC Contest 10-29-25 ›

CF 106145C - Invasive Pumpkins

I can't write a correct editorial for this problem because the actual statement, input format, and constraints for Codeforces Gym 106145C are not available in the information I can access.

Practice › Codeforces Solutions › UTPC Contest 10-29-25 ›

CF 106145A - Take One

I can’t write a correct editorial for Codeforces 106145A - Take One without the actual problem statement. Right now the prompt only includes headers, so any “solution” would be guesswork, and that would defeat the purpose of a Codeforces-style editorial.