UTPC Contest 03-22-24 Div. 2 (Beginner)

8 problems from UTPC Contest 03-22-24 Div. 2 (Beginner) (contest 105048), difficulty -. 1/8 solutions verified against sample I/O.

8 items

UTPC Contest 03-22-24 Div. 2 (Beginner)

Div. 2 | 8 problems | 1/8 verified | Difficulty - | 12m 47s

# Problem Rating Tags Accepted Time ✓
A To be, or not to be? 1m 12s ✓
B Romeo and Random Walk 1m 18s
C Wordy Painting 1m 44s
D By the pricking of my thumbs, Pupil #1 this way comes 47s
E Book Rewriting 1m 43s
F Word Inventing 1m 31s
G As I end the Refrain 3m 8s
H Stringliloquy 1m 24s
Practice › Codeforces Solutions › UTPC Contest 03-22-24 Div. 2 (Beginner) ›

CF 105048G - As I end the Refrain

We are given two independent sequences that interact multiplicatively and additively across many decisions. Each bakery has a position value $xi$. Each mailbox has a position $yj$ and an associated cost $kj$. For every bakery, Cyrano chooses exactly one mailbox to visit.
codeforces competitive-programming Jun 28, 2026
Practice › Codeforces Solutions › UTPC Contest 03-22-24 Div. 2 (Beginner) ›

CF 105048H - Stringliloquy

We are given a long string representing a “text” of length $N$. Alongside it, we are also given a set of $M$ distinct words. The total length of all words combined is bounded, so although there may be many words, their combined structure is still compact.
codeforces competitive-programming Jun 28, 2026
Practice › Codeforces Solutions › UTPC Contest 03-22-24 Div. 2 (Beginner) ›

CF 105048F - Word Inventing

We are given a string of length $n$. We are allowed to repeatedly apply a swap operation that exchanges characters at positions $i$ and $i+k$, as long as both indices are valid. These swaps can be performed any number of times in any order.
codeforces competitive-programming Jun 28, 2026
Practice › Codeforces Solutions › UTPC Contest 03-22-24 Div. 2 (Beginner) ›

CF 105048E - Book Rewriting

We are given a fixed list of distinct words that William does not know. During his work, he reads a sequence of sentences in order, and every word in those sentences belongs to this “unknown vocabulary” set.
codeforces competitive-programming Jun 28, 2026
Practice › Codeforces Solutions › UTPC Contest 03-22-24 Div. 2 (Beginner) ›

CF 105048C - Wordy Painting

We are maintaining a grid of stacks. Each cell in an $N times N$ board stores a vertical stack of letters, where each update either pushes a letter onto the stack, pops the top letter, or asks whether the current stack has a “dominant” letter.
codeforces competitive-programming Jun 28, 2026
Practice › Codeforces Solutions › UTPC Contest 03-22-24 Div. 2 (Beginner) ›

CF 105048D - By the pricking of my thumbs, Pupil #1 this way comes

Working
codeforces competitive-programming Jun 28, 2026
Practice › Codeforces Solutions › UTPC Contest 03-22-24 Div. 2 (Beginner) ›

CF 105048A - To be, or not to be?

We are given a single line of text that may contain uppercase and lowercase English letters mixed with spaces. The task is to determine whether the contiguous sequence of characters “be” appears anywhere in this text when we ignore capitalization.
codeforces competitive-programming Jun 28, 2026
Practice › Codeforces Solutions › UTPC Contest 03-22-24 Div. 2 (Beginner) ›

CF 105048B - Romeo and Random Walk

We are given a set of points on a number line, each point representing a possible initial position of Juliet at time zero. Romeo later learns that at time d, Juliet must lie somewhere inside a known interval [A, B].
codeforces competitive-programming Jun 28, 2026