2022 Hubei Provincial Collegiate Programming Contest

13 problems from 2022 Hubei Provincial Collegiate Programming Contest (contest 103729), difficulty -. 2/13 solutions verified against sample I/O.

13 items

2022 Hubei Provincial Collegiate Programming Contest

Special | 13 problems | 2/13 verified | Difficulty - | 10m 17s

# Problem Rating Tags Accepted Time ✓
A Nucleic Acid Test 31s
B Potion(easy version) 2m 5s
C Potion(hard version) 36s
D Transition 53s ✓
E Multigate 26s
F Angel 52s ✓
G Brick 26s
H Hamster and Multiplication 2m 7s
I Latitude Compressor 25s
J Palindrome Reversion 31s
K PTT 29s
L Chtholly and the Broken Chronograph 27s
M Super Star Spectacle 29s
Practice › Codeforces Solutions › 2022 Hubei Provincial Collegiate Programming Contest ›

CF 103729H - Hamster and Multiplication

Let $f$ be a Boolean function of variables $x1,dots,xn$ and let $g$ be obtained from $f$ by the condensation $x{k+1} leftarrow xk$. Thus $g$ is the restriction of $f$ to the diagonal substitution in which every occurrence of $x{k+1}$ is replaced by $xk$.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › 2022 Hubei Provincial Collegiate Programming Contest ›

CF 103729M - Super Star Spectacle

I don’t have the actual problem statement for Codeforces 103729M - Super Star Spectacle, so I can’t reliably reconstruct the intended solution, constraints, or edge cases.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › 2022 Hubei Provincial Collegiate Programming Contest ›

CF 103729L - Chtholly and the Broken Chronograph

I can’t reliably write a correct editorial yet because the problem statement for Codeforces 103729L - Chtholly and the Broken Chronograph is not available in your prompt, and it is not fully accessible from the search results (they only show submission/status logs, not the…
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › 2022 Hubei Provincial Collegiate Programming Contest ›

CF 103729K - PTT

I can’t produce a correct editorial yet because the actual problem statement for Codeforces 103729K - PTT is not included in your message. Right now there’s no information about: what the input represents, what is being optimized or computed, or even the output format.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › 2022 Hubei Provincial Collegiate Programming Contest ›

CF 103729I - Latitude Compressor

I can’t reliably write a correct editorial without the actual problem statement. “Latitude Compressor” isn’t enough to reconstruct the task, and guessing would almost certainly produce the wrong solution details, constraints, and even the wrong algorithm.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › 2022 Hubei Provincial Collegiate Programming Contest ›

CF 103729J - Palindrome Reversion

I don’t have the actual statement for Codeforces 103729J - Palindrome Reversion in the prompt, and without it I can’t reliably reconstruct the intended problem or derive a correct solution.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › 2022 Hubei Provincial Collegiate Programming Contest ›

CF 103729D - Transition

We are given two binary strings of equal length. The task is to transform the first string into the second using two allowed operations. One operation swaps any two positions at a cost equal to the distance between those indices.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › 2022 Hubei Provincial Collegiate Programming Contest ›

CF 103729G - Brick

I don’t have the actual statement for Codeforces 103729G - Brick in your message, so I can’t safely write a correct editorial without risking inventing details.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › 2022 Hubei Provincial Collegiate Programming Contest ›

CF 103729B - Potion(easy version)

Let $g$ be obtained from $f$ by setting $x{k+1} leftarrow xk$. Every subfunction of $g$ is obtained by fixing variables among $x1,dots,xk,x{k+2},dots,xn$, and then evaluating $f$ under the additional constraint $x{k+1}=xk$.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › 2022 Hubei Provincial Collegiate Programming Contest ›

CF 103729F - Angel

We are given a line of $n$ holes labeled from left to right. An entity starts in one of these holes, but its exact starting position is unknown. Every minute, before we act, we are allowed to inspect exactly one hole.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › 2022 Hubei Provincial Collegiate Programming Contest ›

CF 103729E - Multigate

I can write the full editorial in that format, but I’m missing the actual problem statement for Codeforces 103729E - Multigate.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › 2022 Hubei Provincial Collegiate Programming Contest ›

CF 103729C - Potion(hard version)

I can’t reliably write a correct editorial for “Codeforces 103729C - Potion (hard version)” without the actual problem statement.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › 2022 Hubei Provincial Collegiate Programming Contest ›

CF 103729A - Nucleic Acid Test

I don’t have the actual statement for Codeforces 103729A “Nucleic Acid Test” in the prompt you provided, so I can’t safely reconstruct the intended problem or derive a correct solution without guessing.
codeforces competitive-programming Jul 2, 2026