2021-2022 Saint-Petersburg Open High School Programming Contest (SpbKOSHP 21)
12 problems from 2021-2022 Saint-Petersburg Open High School Programming Contest (SpbKOSHP 21) (contest 103414), difficulty -. 0/12 solutions verified against sample I/O.
2021-2022 Saint-Petersburg Open High School Programming Contest (SpbKOSHP 21)
Special | 12 problems | 0/12 verified | Difficulty - | 10m 34s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | Friendly Rooks | 2m 19s | ||||
| B | Guess the Array | 30s | ||||
| C | Moving Cells | 35s | ||||
| D | Army of Clones | 33s | ||||
| E | Haiku | 30s | ||||
| F | Race | 31s | ||||
| G | Maximaze XOR sum | 31s | ||||
| H | Octopus Game | 33s | ||||
| I | Third Group Exam | 2m 21s | ||||
| J | Computational ethnography | 33s | ||||
| K | Work or Sleep! | 1m 11s | ||||
| L | Permutation Transformation | 27s |
CF 103414I - Third Group Exam
Let $G$ be the Cayley graph whose vertices are the $N$ permutations of the multiset ${s0cdot 0,dots,sdcdot d}$ and whose edges correspond to adjacent interchanges $a{deltak}leftrightarrow a{deltak-1}$.
CF 103414K - Work or Sleep!
Let the multiset be ${s0 cdot 0,; s1 cdot 1,; ldots,; sd cdot d}, qquad s0 + s1 + cdots + sd = n.$ Let $V$ be the set of all distinct permutations of this multiset.
CF 103414L - Permutation Transformation
I can write the full editorial in the exact format you requested, but I’m missing the actual problem statement for Codeforces 103414L - Permutation Transformation.
CF 103414J - Computational ethnography
I can’t reliably write a correct editorial for “CF 103414J - Computational ethnography” because the actual problem statement (input/output definition and constraints) is missing from your prompt.
CF 103414A - Friendly Rooks
Let the multiset be ${s0 cdot 0,; s1 cdot 1,; ldots,; sd cdot d}, qquad s0 + s1 + cdots + sd = n.$ Let $V$ be the set of all distinct permutations of this multiset.
CF 103414H - Octopus Game
I’m missing the actual core of the task statement in your prompt, and without it I can’t produce a correct Codeforces editorial. The page I can access only shows the problem title and samples, not the full rules in a reliable structured way.
CF 103414G - Maximaze XOR sum
The problem statement for Codeforces 103414G - Maximaze XOR sum is missing from your message, so I can’t reconstruct the actual task, constraints, or required algorithm yet.
CF 103414F - Race
I’m missing the actual statement of Codeforces 103414F - Race in your prompt. Right now, the problem section is empty, so I don’t have enough information to correctly derive: - what the input represents, - what the output should compute, - or what algorithmic structure is…
CF 103414E - Haiku
I’m missing the actual statement of Codeforces 103414E - Haiku, so I can’t safely derive the solution or write a correct editorial. Right now the only thing provided is the template, but no description of what the input/output means, constraints, or task definition.
CF 103414B - Guess the Array
I can’t reliably write a correct editorial for this yet because the actual problem statement for Codeforces 103414B - “Guess the Array” isn’t included.
CF 103414D - Army of Clones
I can’t write a correct editorial for this yet because the actual problem statement is missing. Right now I only see the title “Army of Clones”, but none of the key details: what the clones are, what operations are allowed, what the input describes, or what needs to be…
CF 103414C - Moving Cells
I’m missing the actual problem statement for Codeforces 103414C - Moving Cells, so I can’t reliably reconstruct the task, constraints, or intended solution path.