2024 China Collegiate Programming Contest (CCPC) Jinan Site (The 3rd Universal Cup. Stage 17: Jinan)
13 problems from 2024 China Collegiate Programming Contest (CCPC) Jinan Site (The 3rd Universal Cup. Stage 17: Jinan) (contest 105540), difficulty -. 3/13 solutions verified against sample I/O.
2024 China Collegiate Programming Contest (CCPC) Jinan Site (The 3rd Universal Cup. Stage 17: Jinan)
Special | 13 problems | 3/13 verified | Difficulty - | 7m 17s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | The Fool | 51s | ✓ | |||
| B | The Magician | 31s | ||||
| C | The Empress | 33s | ||||
| D | The Emperor | 49s | ✓ | |||
| E | The Chariot | 30s | ||||
| F | The Hermit | 27s | ||||
| G | The Wheel of Fortune | 28s | ||||
| H | Strength | 30s | ||||
| I | The Hanged Man | 25s | ||||
| J | Temperance | 48s | ✓ | |||
| K | The Devil | 28s | ||||
| L | The Tower | 32s | ||||
| M | Judgement | 25s |
CF 105540M - Judgement
I can’t write a correct editorial for this yet because the actual problem statement for Codeforces 105540M - Judgement is missing from your prompt.
CF 105540L - The Tower
I can’t write a correct editorial for Codeforces 105540L - The Tower because the problem statement is not included in your prompt.
CF 105540J - Temperance
We are given a set of points in 3D space, where each point represents a plant located at integer coordinates. For any plant, we look at how many other plants share its x-coordinate, how many share its y-coordinate, and how many share its z-coordinate.
CF 105540K - The Devil
I don’t have the actual problem statement for Codeforces 105540K - The Devil in your prompt (the “Problem Statement / Input / Output” sections are empty), so I can’t correctly reconstruct the task or derive a valid solution.
CF 105540H - Strength
I cannot reliably reconstruct the full statement of Codeforces 105540H - Strength from available references, and I should not fabricate a solution.
CF 105540I - The Hanged Man
The problem statement is missing from the prompt, so I can’t reconstruct what “The Hanged Man (Codeforces 105540I)” is asking for. Without the actual rules, inputs, and outputs, any editorial would be guesswork and likely wrong.
CF 105540G - The Wheel of Fortune
The problem statement for Codeforces 105540G - The Wheel of Fortune is not included in your message, so there is not enough information to write a correct or meaningful editorial.
CF 105540D - The Emperor
The problem is a probabilistic process on three competing populations. You start with a fixed number of rocks, scissors, and papers. Over time, pairs of individuals are chosen uniformly at random from all remaining individuals.
CF 105540F - The Hermit
I can’t write a correct editorial for “Codeforces 105540F - The Hermit” because the actual problem statement is missing from your message. Right now there is no information about what the input represents, what needs to be computed, or any constraints.
CF 105540E - The Chariot
The problem statement is missing from your prompt, so I don’t have enough information to write a correct editorial for Codeforces 105540E - The Chariot.
CF 105540A - The Fool
We are given a rectangular grid with $n$ rows and $m$ columns. Each cell is not a single character but a short string of fixed length $k$. So every position in the grid stores a “word”, and all words in the grid are supposed to follow a very strict pattern.
CF 105540C - The Empress
I can’t write a correct editorial for “Codeforces 105540C - The Empress” because the actual problem statement is missing.
CF 105540B - The Magician
I don’t have the actual statement of Codeforces 105540B “The Magician” in your message, so I can’t safely reconstruct the problem or derive a correct solution without risking inventing details.