2024 China Collegiate Programming Contest (CCPC) Chongqing Onsite
13 problems from 2024 China Collegiate Programming Contest (CCPC) Chongqing Onsite (contest 106030), difficulty -. 3/13 solutions verified against sample I/O.
2024 China Collegiate Programming Contest (CCPC) Chongqing Onsite
Special | 13 problems | 3/13 verified | Difficulty - | 9m 25s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | \u4e58\u79ef\uff0c\u6b27\u62c9\u51fd\u6570\uff0c\u6c42\u548c | 48s | ||||
| B | osu!mania | 40s | ||||
| C | \u8fde\u65b9 | 35s | ||||
| D | \u6709\u9650\u5c0f\u6570 | 52s | ✓ | |||
| E | \u5408\u6210\u5927\u897f\u74dc | 28s | ||||
| F | Pico Park | 31s | ||||
| G | \u9b54\u5f39 | 30s | ||||
| H | str(list(s)) | 48s | ✓ | |||
| I | \u7b97\u672f | 29s | ||||
| J | \u9ab0\u5b50 | 30s | ||||
| K | \u5c0f C \u7684\u795e\u79d8\u56fe\u5f62 | 46s | ||||
| L | \u6c99\u5806 | 32s | ||||
| M | Median Replacement | 1m 56s | ✓ |
CF 106030H - str(list(s))
The task revolves around applying a very specific transformation to a single string using Python’s built-in list conversion semantics.
CF 106030D - 有限小数
The task revolves around deciding whether a given rational number can be represented as a terminating decimal. In other words, for each provided fraction, we want to determine whether its decimal expansion ends after a finite number of digits instead of continuing indefinitely.
CF 106030K - 小 C 的神秘图形
The statement for “Codeforces 106030K - 小 C 的神秘图形” is not actually included in what you provided.
CF 106030B - osu!mania
I can’t reliably reconstruct Codeforces 106030B - osu!mania from the information provided here. The statement section is effectively empty, and this problem name has multiple possible interpretations in CF gym sets (typically involving rhythm lanes, falling notes, or grid…
CF 106030M - Median Replacement
We are given a list of $n$ positions, and each position $i$ is not fixed to a single value but instead allows any integer in a range $[li, ri]$. So each valid array is formed by independently choosing one value inside each interval.
CF 106030L - 沙堆
I can’t produce a correct editorial from what you’ve provided, because the actual problem content (input/output format, rules of the sand pile process, constraints) is missing. Right now I only see the title “沙堆” with empty input and output sections.
CF 106030J - 骰子
I can’t write a correct editorial for this yet because the actual problem content is missing. Right now all we have is the title “骰子” (dice), but no statement, constraints, or input/output rules.
CF 106030I - 算术
The statement you pasted only contains the title “I. 算术” with empty input and output sections, so there is no information about what the problem is actually asking to compute.
CF 106030G - 魔弹
The problem statement you provided is incomplete. It only contains the title “G. 魔弹” without any description of the input format, output requirements, constraints, or the underlying task.
CF 106030F - Pico Park
I can’t reliably write a correct Codeforces-style editorial for 106030F - Pico Park because the problem statement in your prompt is missing (only the title is present, with no description of inputs, outputs, or rules).
CF 106030E - 合成大西瓜
The statement you provided is essentially empty (no input/output description or rules), so there is not enough information to write a correct editorial.
CF 106030A - 乘积，欧拉函数，求和
I can’t reliably write a correct editorial here because the actual problem content is missing. Right now, the statement only shows a title (“product, Euler function, sum”) but no definitions, no input format, no output format, and no constraints.