“华为杯”2025 年广东工业大学 ACM 程序设计竞赛

13 problems from “华为杯”2025 年广东工业大学 ACM 程序设计竞赛 (contest 105806), difficulty -. 1/13 solutions verified against sample I/O.

13 items

“华为杯”2025 年广东工业大学 ACM 程序设计竞赛

Special | 13 problems | 1/13 verified | Difficulty - | 9m 17s

#	Problem	Time	✓
A	\u51fa\u52e4\u89c4\u5212	30s
B	\u4e8c\u5206\u70bc\u72f1	45s
C	BloomsTD6	2m	✓
D	\u6a58\u732b\u7684\u80cc\u5305\u95ee\u9898	34s
E	GDUT = 1	32s
F	\u6392\u961f	45s
G	Jump Sort	45s
H	\u53ef\u7231\u4e32\u4e32	33s
I	\u597d\u60f3\u6210\u4e3a\u4eba\u7c7b\u554a	32s
J	11 \u80cc\u5305	33s
K	\u6a58\u732b\u7684\u540e\u7f00\u95ee\u9898	31s
L	\u5b57\u7b26\u4e32\u5339\u914d\u592a\u591a\u4e86\uff01	47s
M	\u665a\u996d\u5403\u4ec0\u4e48\uff1f	30s

Practice › Codeforces Solutions › “华为杯”2025 年广东工业大学 ACM 程序设计竞赛 ›

CF 105806A - 出勤规划

I can’t write a correct editorial yet because the actual problem statement is missing. Right now the prompt only contains “A” for the statement and empty Input/Output sections, which doesn’t give enough information to determine what the task is (inputs, constraints, or…

Practice › Codeforces Solutions › “华为杯”2025 年广东工业大学 ACM 程序设计竞赛 ›

CF 105806E - GDUT = 1

I can’t write a correct editorial for this problem yet because the actual problem statement is missing. Right now the only content provided is just the label “E”, with no description of what the input represents, what operations are allowed, or what needs to be computed.

Practice › Codeforces Solutions › “华为杯”2025 年广东工业大学 ACM 程序设计竞赛 ›

CF 105806L - 字符串匹配太多了！

I can’t write a correct editorial yet because the actual problem statement for Codeforces 105806L - “字符串匹配太多了！” is missing from your prompt (it only shows “L” and empty input/output sections).

Practice › Codeforces Solutions › “华为杯”2025 年广东工业大学 ACM 程序设计竞赛 ›

CF 105806I - 好想成为人类啊

I can’t reliably reconstruct the problem from just the title and empty statement (“I”) without risking inventing details, and that would make the editorial wrong. Please paste the full problem statement (or a link / screenshot text).

Practice › Codeforces Solutions › “华为杯”2025 年广东工业大学 ACM 程序设计竞赛 ›

CF 105806H - 可爱串串

The problem statement you provided is incomplete. Right now it only contains the title “H” with empty input and output sections, so there is no way to reconstruct what the task is actually asking, what the constraints are, or what kind of operations are involved.

Practice › Codeforces Solutions › “华为杯”2025 年广东工业大学 ACM 程序设计竞赛 ›

CF 105806F - 排队

I can’t responsibly write a correct Codeforces editorial for “105806F - 排队” because the actual problem content (input format, rules of the queue, and required output) is missing. Right now, only the title is present, and everything else in the statement is blank.

Practice › Codeforces Solutions › “华为杯”2025 年广东工业大学 ACM 程序设计竞赛 ›

CF 105806B - 二分炼狱

I can’t write a correct editorial for this problem yet because the actual problem statement content is missing. Right now, the only thing provided is the title “二分炼狱”, but there are no definitions of the input, output, or the task itself.

Practice › Codeforces Solutions › “华为杯”2025 年广东工业大学 ACM 程序设计竞赛 ›

CF 105806J - 11 背包

The problem statement you pasted is effectively empty (“J”), so there’s no information about the input format, constraints, or what “11 背包” is supposed to mean in this context.

Practice › Codeforces Solutions › “华为杯”2025 年广东工业大学 ACM 程序设计竞赛 ›

CF 105806G - Jump Sort

I’m missing the actual problem statement for Codeforces 105806G - Jump Sort (the content section only shows “G” with no description, input/output, or rules).

Practice › Codeforces Solutions › “华为杯”2025 年广东工业大学 ACM 程序设计竞赛 ›

CF 105806C - BloomsTD6

We are given a geometric defense simulation on a fixed polyline path. A set of balloons appears over time. Each balloon starts at a given arrival time and then moves along a shared piecewise-linear path in the plane at unit speed.

Practice › Codeforces Solutions › “华为杯”2025 年广东工业大学 ACM 程序设计竞赛 ›

CF 105806M - 晚饭吃什么？

The problem information provided here is incomplete, so a correct editorial cannot be written yet. Right now, the statement only shows a label “M” without any description of the input format, output format, or task definition.

Practice › Codeforces Solutions › “华为杯”2025 年广东工业大学 ACM 程序设计竞赛 ›

CF 105806K - 橘猫的后缀问题

The statement you provided is incomplete. Right now it only contains the title and a single “K”, with no description of the input, output, or task definition.

Practice › Codeforces Solutions › “华为杯”2025 年广东工业大学 ACM 程序设计竞赛 ›

CF 105806D - 橘猫的背包问题

I can’t write a correct editorial for this yet because the actual problem statement is missing. Right now I only see the title “Codeforces 105806D - 橘猫的背包问题” without any description of the knapsack variant, constraints, or what is being optimized.