UTPC Contest 3-11-26 (Beginner)

8 problems from UTPC Contest 3-11-26 (Beginner) (contest 106420), difficulty -. 8/8 solutions verified against sample I/O.

8 items

UTPC Contest 3-11-26 (Beginner)

Special | 8 problems | 8/8 verified | Difficulty - | 6m 54s

# Problem Rating Tags Accepted Time ✓
A Bouncy Castle 44s ✓
B Beta Tester 1m 1s ✓
C Champion's Meeting (Easy) 1m 5s ✓
D Anagrams 42s ✓
E Strongest Attack First 38s ✓
F Chippa Rank 47s ✓
G Tyson's Taunt 1m 3s ✓
H Red Combo 54s ✓
Practice › Codeforces Solutions › UTPC Contest 3-11-26 (Beginner) ›

CF 106420E - Strongest Attack First

We are given a sequence of enemy attack waves. Each wave has two parameters: a damage rate per second and a duration. If the player chooses a level ℓ, every wave is weakened by subtracting ℓ from its damage rate, but never below zero.
codeforces competitive-programming Jun 20, 2026
Practice › Codeforces Solutions › UTPC Contest 3-11-26 (Beginner) ›

CF 106420D - Anagrams

We are given a very small multiset of characters, and we are asked to consider every distinct string that can be formed by rearranging some or all of those characters.
codeforces competitive-programming Jun 20, 2026
Practice › Codeforces Solutions › UTPC Contest 3-11-26 (Beginner) ›

CF 106420G - Tyson's Taunt

We are given an array of integers and a pair of real thresholds $a$ and $b$. The task is to count how many contiguous subarrays have an average that lies in a specific range.
codeforces competitive-programming Jun 20, 2026
Practice › Codeforces Solutions › UTPC Contest 3-11-26 (Beginner) ›

CF 106420H - Red Combo

We are given a permutation-like process that builds a structure by repeatedly merging or “validating” adjacent segments of values.
codeforces competitive-programming Jun 20, 2026
Practice › Codeforces Solutions › UTPC Contest 3-11-26 (Beginner) ›

CF 106420C - Champion's Meeting (Easy)

We are given two ordered lists of racers, where every racer has a unique prestige value. The task is to construct a single final lineup by repeatedly picking the next racer either from the front of the first list or the front of the second list, always consuming one element at…
codeforces competitive-programming Jun 20, 2026
Practice › Codeforces Solutions › UTPC Contest 3-11-26 (Beginner) ›

CF 106420B - Beta Tester

The problem can be understood as exploring connectivity in a directed system of rooms. Each room represents a node in a graph, and each one-way vent represents a directed edge from one node to another.
codeforces competitive-programming Jun 20, 2026
Practice › Codeforces Solutions › UTPC Contest 3-11-26 (Beginner) ›

CF 106420F - Chippa Rank

We are given a system of runners where each standard runner, called an uma, has a starting parameter and a speed. There is also a special runner, Chippi Chappa, whose performance depends on a query value.
codeforces competitive-programming Jun 19, 2026
Practice › Codeforces Solutions › UTPC Contest 3-11-26 (Beginner) ›

CF 106420A - Bouncy Castle

We are given a single integer $n$, and we want to determine the largest integer $x$ such that a certain geometric or combinatorial construction is possible.
codeforces competitive-programming Jun 19, 2026