2021-2022 ACM-ICPC Brazil Subregional Programming Contest

14 problems from 2021-2022 ACM-ICPC Brazil Subregional Programming Contest (contest 103388), difficulty -. 2/14 solutions verified against sample I/O.

14 items

2021-2022 ACM-ICPC Brazil Subregional Programming Contest

ICPC/IOI | 14 problems | 2/14 verified | Difficulty - | 17m 1s

# Problem Rating Tags Accepted Time ✓
A Assigning Prizes 2m 28s
B Beautiful Words 32s
C Creating Multiples 30s
D Dividing the Kingdom 51s ✓
E Escalator 30s
F Freedom from Prison 29s
G Getting in Shape 53s ✓
H Handling the Blocks 25s
I Inverting Everything 2m 17s
J Just Bootfall 26s
K Kathmandu 22s
L Listing Passwords 1m 25s
M Monarchy in Vertigo 32s
N No Luck 5m 21s
Practice › Codeforces Solutions › 2021-2022 ACM-ICPC Brazil Subregional Programming Contest ›

CF 103388N - No Luck

Codeforces 103388N: No Luck
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › 2021-2022 ACM-ICPC Brazil Subregional Programming Contest ›

CF 103388L - Listing Passwords

The binomial tree $Tn$ used in this section has $2^n$ nodes, each node corresponding to a binary string of length $n$, and $Tinfty$ is the limiting structure in which nodes correspond to all finite binary strings obtained by suppressing leading zeros.
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › 2021-2022 ACM-ICPC Brazil Subregional Programming Contest ›

CF 103388I - Inverting Everything

Write $N$ in binary form $$N = (am a{m-1}dots a0)2 = sum{i=0}^m ai 2^i.$$ Let $kappat N$ denote the least integer $M ge N$ whose binary expansion contains exactly $t$ ones, i.e.
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › 2021-2022 ACM-ICPC Brazil Subregional Programming Contest ›

CF 103388M - Monarchy in Vertigo

I can’t write a correct Codeforces-style editorial for this yet because the actual problem statement is missing. Right now I only have the title (“103388M - Monarchy in Vertigo”), but no description of the rules, input format, or what needs to be computed.
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › 2021-2022 ACM-ICPC Brazil Subregional Programming Contest ›

CF 103388K - Kathmandu

I can’t reliably write a correct Codeforces editorial for 103388K - Kathmandu because the actual problem statement is missing from your prompt.
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › 2021-2022 ACM-ICPC Brazil Subregional Programming Contest ›

CF 103388A - Assigning Prizes

Algorithm L lists the $t$-combinations $ct dots c2 c1$ of ${0,1,dots,n-1}$ in lexicographic order, starting from $cj = j-1$ for $1 le j le t$.
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › 2021-2022 ACM-ICPC Brazil Subregional Programming Contest ›

CF 103388J - Just Bootfall

The problem statement for Codeforces 103388J - Just Bootfall is not included in your prompt, so I don’t have the actual input/output definition, constraints, or operations the solution is based on.
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › 2021-2022 ACM-ICPC Brazil Subregional Programming Contest ›

CF 103388H - Handling the Blocks

The problem statement for Codeforces 103388H - Handling the Blocks is not included in your message, so I don’t have enough information to reconstruct the task, constraints, or required solution.
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › 2021-2022 ACM-ICPC Brazil Subregional Programming Contest ›

CF 103388F - Freedom from Prison

I don’t have the actual statement of Codeforces 103388F - Freedom from Prison, and without it I can’t reliably reconstruct the problem or produce a correct editorial. Anything I write would be guesswork, and that would defeat the purpose of a Codeforces-style explanation.
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › 2021-2022 ACM-ICPC Brazil Subregional Programming Contest ›

CF 103388D - Dividing the Kingdom

We are given a network of cities connected by undirected roads, where each road has a positive weight representing its “beauty.” The task is to split the set of cities into two groups.
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › 2021-2022 ACM-ICPC Brazil Subregional Programming Contest ›

CF 103388E - Escalator

The problem statement is missing, so I don’t have enough information to write a correct editorial. “Codeforces 103388E - Escalator” could correspond to several different tasks (there are multiple “escalator” style problems involving queues, probabilities, DP, or…
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › 2021-2022 ACM-ICPC Brazil Subregional Programming Contest ›

CF 103388B - Beautiful Words

I don’t have the actual problem statement for Codeforces 103388B (“Beautiful Words”) in your prompt, and the rest of the editorial depends entirely on it.
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › 2021-2022 ACM-ICPC Brazil Subregional Programming Contest ›

CF 103388C - Creating Multiples

I can’t reliably write a correct editorial for CF 103388C - Creating Multiples because the actual problem statement is missing.
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › 2021-2022 ACM-ICPC Brazil Subregional Programming Contest ›

CF 103388G - Getting in Shape

Think of the string as defining a walk starting at index 0. Every B behaves like a forced edge to i+1. Every A behaves like a node with two outgoing possibilities, one to i+1 and one to i+2.
codeforces competitive-programming Jul 3, 2026