UTPC Contest 04-08-22 Div. 1 (Advanced)

9 problems from UTPC Contest 04-08-22 Div. 1 (Advanced) (contest 103648), difficulty -. 1/9 solutions verified against sample I/O.

9 items

UTPC Contest 04-08-22 Div. 1 (Advanced)

Div. 1 | 9 problems | 1/9 verified | Difficulty - | 7m 23s

# Problem Rating Tags Accepted Time ✓
D Parrot Riddles 35s
E Bird Watching 1m 5s
F Firebird 32s
G Dove Dance 49s ✓
H Fledgling Fight 32s
I Adeleke's Bird Flocks 2m 13s
J Birding In The Rain 28s
K Food Search 27s
L Communist Crows 42s
Practice › Codeforces Solutions › UTPC Contest 04-08-22 Div. 1 (Advanced) ›

CF 103648I - Adeleke's Bird Flocks

Let $x in [0,1)$ and write its dyadic expansion $$x = 0.x1 x2 x3 ldots,qquad xj in {0,1}.$$ Let $rj(x)$ denote the $j$-th Rademacher function, $$rj(x) = (-1)^{xj}.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › UTPC Contest 04-08-22 Div. 1 (Advanced) ›

CF 103648L - Communist Crows

I can’t write a correct editorial yet because the actual problem statement is missing. Right now I only see the title, input/output placeholders, and formatting instructions, but no description of what “Communist Crows” is asking us to compute.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › UTPC Contest 04-08-22 Div. 1 (Advanced) ›

CF 103648K - Food Search

I’m missing the actual problem statement, input/output format, and constraints for Codeforces 103648K - Food Search. Without those, any “editorial” would be guesswork, and I’d risk inventing a solution that doesn’t match the problem.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › UTPC Contest 04-08-22 Div. 1 (Advanced) ›

CF 103648J - Birding In The Rain

The problem statement is missing from your prompt, so there’s no reliable way to write a correct editorial for it.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › UTPC Contest 04-08-22 Div. 1 (Advanced) ›

CF 103648G - Dove Dance

The brute-force idea is to maintain an explicit set of all strings currently in the dance and, on each query, iterate over all strings and check whether the query is a prefix of any of them. For a type three operation, we physically reverse every string in the set.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › UTPC Contest 04-08-22 Div. 1 (Advanced) ›

CF 103648H - Fledgling Fight

The problem statement is missing from your prompt (both the description and I/O sections are empty), so there isn’t enough information to write a correct Codeforces editorial. “Fledgling Fight” could refer to many different mechanics (graphs, game theory, simulation, etc.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › UTPC Contest 04-08-22 Div. 1 (Advanced) ›

CF 103648E - Bird Watching

Let $x in [0,1)$ and write its dyadic expansion $$x = 0.x1 x2 x3 ldots,qquad xj in {0,1}.$$ Let $rj(x)$ denote the $j$-th Rademacher function, $$rj(x) = (-1)^{xj}.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › UTPC Contest 04-08-22 Div. 1 (Advanced) ›

CF 103648D - Parrot Riddles

I can’t write a correct editorial for “Codeforces 103648D - Parrot Riddles” because the actual problem statement is missing from your prompt.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › UTPC Contest 04-08-22 Div. 1 (Advanced) ›

CF 103648F - Firebird

I can’t write a correct editorial for that problem yet because the actual statement (what Firebird asks, what the input/output mean, and constraints) is missing. Right now I only know the Codeforces ID, not the problem content.
codeforces competitive-programming Jul 2, 2026