UTPC Contest 10-23-20 Div. 2

8 problems from UTPC Contest 10-23-20 Div. 2 (contest 102783), difficulty -. 6/8 solutions verified against sample I/O.

8 items

UTPC Contest 10-23-20 Div. 2

Div. 2 | 8 problems | 6/8 verified | Difficulty - | 7m 55s

# Problem Rating Tags Accepted Time ✓
A Mr. Skeleton 1m 9s
B Heading Home 1m 13s ✓
C Optimal Trick or Treating 1m ✓
D Ghost-or-Treat 51s ✓
E Spooky Numbers 50s ✓
F Xorro the Xorman 48s ✓
G Hyper Chocolate Cubes 1m 17s ✓
H Slime-inator 47s
Practice › Codeforces Solutions › UTPC Contest 10-23-20 Div. 2 ›

CF 102783B - Heading Home

The problem describes a person standing at one point on a number line and trying to reach their home at another point. In one second, they can move any positive distance from 1 up to a given maximum distance d.
codeforces competitive-programming Jul 27, 2026
Practice › Codeforces Solutions › UTPC Contest 10-23-20 Div. 2 ›

CF 102783C - Optimal Trick or Treating

Timmy wants to maximize the number of Chuckles bars he can obtain. Each house in the neighborhood contains some collection of candies. Alice has a fixed exchange rate for each candy type, meaning every candy type is worth a certain number of Chuckles bars.
codeforces competitive-programming Jul 27, 2026
Practice › Codeforces Solutions › UTPC Contest 10-23-20 Div. 2 ›

CF 102783H - Slime-inator

I can write the full editorial, but the problem statement details are required to produce a correct solution. The statement section in your prompt is empty, and the title alone is not enough to safely derive the intended algorithm.
codeforces competitive-programming Jul 27, 2026
Practice › Codeforces Solutions › UTPC Contest 10-23-20 Div. 2 ›

CF 102783G - Hyper Chocolate Cubes

Felix receives hypercubes of chocolate with sizes corresponding to powers of a chosen side length w. The available pieces have weights: 1, w, w², w³, ..., w¹⁰⁰.
codeforces competitive-programming Jul 27, 2026
Practice › Codeforces Solutions › UTPC Contest 10-23-20 Div. 2 ›

CF 102783F - Xorro the Xorman

The problem gives two non-negative integers, A and B. We must choose an integer b in the interval from 0 to B and maximize the value of A XOR b. The output is the largest XOR value that can be obtained.
codeforces competitive-programming Jul 27, 2026
Practice › Codeforces Solutions › UTPC Contest 10-23-20 Div. 2 ›

CF 102783E - Spooky Numbers

Francine has a collection of decimal digits and wants to arrange some of them into the largest possible spooky number. A spooky number is a non-negative integer divisible by 2, 3, and 5, which means it must be divisible by 30.
codeforces competitive-programming Jul 27, 2026
Practice › Codeforces Solutions › UTPC Contest 10-23-20 Div. 2 ›

CF 102783D - Ghost-or-Treat

We have a line of ghosts, each with an integer age. A move consists of choosing two neighboring ghosts whose ages are different. The younger ghost disappears, while the older ghost remains and becomes one year older.
codeforces competitive-programming Jul 27, 2026
Practice › Codeforces Solutions › UTPC Contest 10-23-20 Div. 2 ›

CF 102783A - Mr. Skeleton

I need the missing problem details to write a correct editorial. Please provide the statement or link for this problem. Waiting for your answer
codeforces competitive-programming Jul 27, 2026