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

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

8 items

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

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

# Problem Rating Tags Accepted Time ✓
A Deck Building 41s ✓
B Pancakes (Easy Version) 51s ✓
C Mega Knight 41s ✓
D Did His Time Come? 29s
E To Leap or Not to Leap 43s ✓
F Bandit and Bridges (Easy) 28s
G Pancakes 41s ✓
H Rocket Cycle 57s ✓
Practice › Codeforces Solutions › UTPC Contest 10-1-25 Div. 2 (Beginner) ›

CF 106096H - Rocket Cycle

We are interacting with a system that hides two distinct integers on a line from 1 to n, call them x₁ and x₂ with x₁ < x₂. We do not know their locations, and the only way to extract information is by issuing queries at chosen positions. Each query is a position x.
codeforces competitive-programming Jun 25, 2026
Practice › Codeforces Solutions › UTPC Contest 10-1-25 Div. 2 (Beginner) ›

CF 106096G - Pancakes

We are given a one-on-one fight between two units that exchange damage every second. Each unit has a fixed attack value and a fixed health value, and every second both deal damage simultaneously: your unit reduces the opponent’s health by its attack, and the opponent reduces…
codeforces competitive-programming Jun 25, 2026
Practice › Codeforces Solutions › UTPC Contest 10-1-25 Div. 2 (Beginner) ›

CF 106096E - To Leap or Not to Leap

The problem asks for the fastest way to move exactly n units. The character can either walk any distance at a fixed speed a, or perform a leap of exactly b units. A leap always takes 3 seconds.
codeforces competitive-programming Jun 25, 2026
Practice › Codeforces Solutions › UTPC Contest 10-1-25 Div. 2 (Beginner) ›

CF 106096F - Bandit and Bridges (Easy)

Sure - I can do that, but I’ll need the full problem statement first. Please paste the Codeforces problem (or give me the contest + problem letter), and tell me if you want the editorial to include things like: - intuition / idea discovery - full proof - implementation details…
codeforces competitive-programming Jun 25, 2026
Practice › Codeforces Solutions › UTPC Contest 10-1-25 Div. 2 (Beginner) ›

CF 106096D - Did His Time Come?

I can write the full editorial in exactly that style, but I’m missing the only thing needed to do it correctly: the actual problem statement. “Codeforces 106096D - Did His Time Come?
codeforces competitive-programming Jun 25, 2026
Practice › Codeforces Solutions › UTPC Contest 10-1-25 Div. 2 (Beginner) ›

CF 106096B - Pancakes (Easy Version)

We are looking at a fight between two units that trade blows every second. Your unit starts with an attack value and a health value, and the opponent has its own attack and health.
codeforces competitive-programming Jun 25, 2026
Practice › Codeforces Solutions › UTPC Contest 10-1-25 Div. 2 (Beginner) ›

CF 106096A - Deck Building

The problem is about building a Clash Royale deck from paired cards. We have two arrays, where index i describes a pair of cards with costs a[i] and b[i]. When building the deck, we cannot take only one card from a pair.
codeforces competitive-programming Jun 25, 2026
Practice › Codeforces Solutions › UTPC Contest 10-1-25 Div. 2 (Beginner) ›

CF 106096C - Mega Knight

We are given a grid with n rows and m columns. Each cell contains a positive value representing the reward obtained if that cell is affected by a spell. We choose exactly one cell as the center of an attack.
codeforces competitive-programming Jun 25, 2026