Школьный этап ВСОШ по информатике 9-11 класс 2021 (4 группа регионов)
0 problems from Школьный этап ВСОШ по информатике 9-11 класс 2021 (4 группа регионов) (contest 103383), difficulty -. 0/0 solutions verified against sample I/O.
Школьный этап ВСОШ по информатике 9-11 класс 2021 (4 группа регионов)
Special | 0 problems | 0/0 verified | Difficulty - |
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| (none) |
CF 1033833 - Два грузчика
Vertices are binary strings $a{2t-1}ldots a1a0$ with exactly $t$ ones. A move consists of choosing $j in {1,ldots,2t-1}$ and swapping $a0 leftrightarrow aj$. Each move preserves the condition $sum{i=0}^{2t-1} ai = t$, hence maps $(t,t)$-combinations to $(t,t)$-combinations.
CF 1033835 - Долгое вычитание, Карл!
I can write the full editorial in exactly that format, but I’m missing the actual problem statement for Codeforces 1033835 - “Долгое вычитание, Карл!”.
CF 1033834 - Любовь и двери
I can’t safely write a correct editorial yet because the problem statement for Codeforces 1033834 - “Любовь и двери” is not available from the standard CF archive under that ID, and it does not correspond cleanly to any known Codeforces problem format or index.
CF 1033831 - Костяные войны
We are given a scenario involving two collectors who each own an infinite multiset of “bone segments”: for every positive integer length, each collector has exactly two identical segments of that length.
CF 1033832 - Потерявшееся число
I don’t have the actual problem statement for Codeforces 1033832 (“Потерявшееся число”) in your message, so I can’t reliably reconstruct or solve it without guessing.