UTPC Contest 10-09-20 Div. 2

7 problems from UTPC Contest 10-09-20 Div. 2 (contest 102757), difficulty -. 5/7 solutions verified against sample I/O.

7 items

UTPC Contest 10-09-20 Div. 2

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

# Problem Rating Tags Accepted Time ✓
A Time Machine 31s
B Modern Gladiator 45s ✓
C Light Festival 36s
D Best Thing Since Sliced Bread 1m 18s ✓
E Hieroglyph Sequences 1m ✓
F Maze Design 58s ✓
G Locked Out 59s ✓
Practice › Codeforces Solutions › UTPC Contest 10-09-20 Div. 2 ›

CF 102757A - Time Machine

I can write the editorial, but the provided prompt requires several sections that depend on the exact samples and problem details.
codeforces competitive-programming Jul 29, 2026
Practice › Codeforces Solutions › UTPC Contest 10-09-20 Div. 2 ›

CF 102757B - Modern Gladiator

The problem simulates a shop where every customer buys one item for one bronze coin. A customer does not always pay with bronze, they may hand over a silver coin or a gold coin. Alfonso must immediately return the correct change before serving the next customer.
codeforces competitive-programming Jul 29, 2026
Practice › Codeforces Solutions › UTPC Contest 10-09-20 Div. 2 ›

CF 102757G - Locked Out

We are given several equal-length digit strings. The digits inside every string are in the wrong positions, but the same unknown rearrangement was applied to all of them.
codeforces competitive-programming Jul 29, 2026
Practice › Codeforces Solutions › UTPC Contest 10-09-20 Div. 2 ›

CF 102757F - Maze Design

The maze is a corridor with exactly three rows and n columns. Each cell is either open or blocked. Alice may begin on any open cell in the first column and can move up, down, left, or right through open cells.
codeforces competitive-programming Jul 29, 2026
Practice › Codeforces Solutions › UTPC Contest 10-09-20 Div. 2 ›

CF 102757E - Hieroglyph Sequences

The problem asks for the smallest number of hieroglyph values in a sequence that must be changed so that the XOR of the entire sequence becomes zero. The input is a sequence of n positive integers, where each integer represents one hieroglyph.
codeforces competitive-programming Jul 29, 2026
Practice › Codeforces Solutions › UTPC Contest 10-09-20 Div. 2 ›

CF 102757D - Best Thing Since Sliced Bread

The problem describes a collection of historical inventions. Each invention has a title, an invention date, and a score representing how close it is to the greatness of sliced bread.
codeforces competitive-programming Jul 29, 2026
Practice › Codeforces Solutions › UTPC Contest 10-09-20 Div. 2 ›

CF 102757C - Light Festival

I can write the editorial, but I need the full problem statement details first. The Codeforces page for 102757C only contains the core geometry problem information, and your prompt’s required sections ask for edge cases, samples, and test cases.
codeforces competitive-programming Jul 29, 2026