The 20-th Beihang University Collegiate Programming Contest (BCPC 2025) - Preliminary
13 problems from The 20-th Beihang University Collegiate Programming Contest (BCPC 2025) - Preliminary (contest 106272), difficulty -. 1/13 solutions verified against sample I/O.
The 20-th Beihang University Collegiate Programming Contest (BCPC 2025) - Preliminary
Special | 13 problems | 1/13 verified | Difficulty - | 8m 53s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | \u5fd7\u613f\u65f6\u957f | 31s | ||||
| B | MAX? MEX? | 38s | ||||
| C | Toxel \u4e0e City Walk | 33s | ||||
| D | Ruler | 37s | ||||
| E | \u86c7\u8bed\u7834\u8bd1 | 35s | ||||
| F | \u86c7\u7403 | 35s | ||||
| G | Astral Quantization | 31s | ||||
| H | \u94f8\u5251 | 48s | ||||
| I | Euler | 25s | ||||
| J | GGEZ | 36s | ||||
| K | Forgotten | 37s | ||||
| L | Serval \u4e0e Toxel \u4e0e popcount | 31s | ||||
| M | Popotnik -The Traveller of Ljubljana- | 1m 56s | ✓ |
CF 106272I - Euler
I can’t write a correct editorial yet because the actual problem statement for “Codeforces 106272I - Euler” is missing from your prompt.
CF 106272B - MAX? MEX?
I can’t reliably write a correct editorial for Codeforces 106272B - MAX? MEX? because the problem statement you provided is empty in the prompt. Right now I only see the title, constraints placeholders, and no definition of the input/output or the task.
CF 106272K - Forgotten
The statement you provided is effectively empty, so there is no way to reconstruct the actual problem being solved.
CF 106272F - 蛇球
The problem statement is effectively empty here, so there is no way to reconstruct what Codeforces 106272F (“蛇球”) is asking. An editorial depends entirely on knowing the operations on the input, the constraints, and what is required to be computed.
CF 106272M - Popotnik -The Traveller of Ljubljana-
We are given a directed process on a graph where each node has a character label. A “travel” is a sequence of exactly $l$ visited nodes. We may start from any node, and each step moves along an edge to a neighboring node.
CF 106272L - Serval 与 Toxel 与 popcount
I can’t reliably write a correct Codeforces editorial for this without the actual problem statement. “106272L - Serval 与 Toxel 与 popcount” gives only the title, but there are many different classic “popcount” problems (range queries, XOR transforms, DP over bits…
CF 106272J - GGEZ
I can’t write a correct editorial yet because the actual problem statement for Codeforces 106272J - GGEZ is missing from your prompt (it only contains the title and placeholders, with no input/output specification or constraints).
CF 106272H - 铸剑
I can’t write a correct Codeforces editorial for this because the actual problem content is missing. Right now all that’s available is the title “铸剑”, but there are no statements, constraints, input/output format, or samples.
CF 106272G - Astral Quantization
I can’t reliably write an editorial for “Codeforces 106272G - Astral Quantization” as-is because the actual problem statement content isn’t present in your prompt, and I don’t have enough information to reconstruct the task without guessing.
CF 106272D - Ruler
I can’t write a correct editorial yet because the actual problem content is missing. Right now the statement only shows the title and empty Input/Output sections, so there’s no definition of what a “ruler” is in this context, what the input represents, or what needs to…
CF 106272E - 蛇语破译
The problem statement is missing, so there isn’t enough information to construct a correct editorial. Right now I only see the title “蛇语破译” and the formatting skeleton, but no description of the rules, input format, or required output.
CF 106272C - Toxel 与 City Walk
The problem statement is missing in your message (the section after “ Input / Output” is empty), so there isn’t enough information to reconstruct what 106272C requires. Right now I don’t know the actual task (graph, strings, geometry, etc.
CF 106272A - 志愿时长
I can’t write a correct editorial for this yet because the actual problem content is missing. Right now I only see the title “志愿时长” and empty input/output sections, but no description of what the problem is asking, no constraints, and no sample cases.