East China University of Science and Technology Programming Championship 2026
12 problems from East China University of Science and Technology Programming Championship 2026 (contest 106467), difficulty -. 5/12 solutions verified against sample I/O.
East China University of Science and Technology Programming Championship 2026
Special | 12 problems | 5/12 verified | Difficulty - | 8m 43s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | Spotlights | 44s | ✓ | |||
| B | Echo Form | 54s | ✓ | |||
| C | Star Farming | 37s | ||||
| D | Left & Right | 28s | ||||
| E | Right & Left | 45s | ||||
| F | Melody | 40s | ||||
| G | CS:Go Over | 30s | ||||
| H | Morrow by Morrow | 46s | ✓ | |||
| I | Stardew Valley | 33s | ||||
| J | Flame Strike 2 | 49s | ✓ | |||
| K | In Filtration 2 | 50s | ✓ | |||
| L | Haitei Raoyue | 1m 7s |
CF 106467G - CS:Go Over
The statement you provided for “Codeforces 106467G - CS:Go Over” is effectively empty, so there isn’t enough information to reconstruct what the problem is asking, what the input format looks like, or what the required output should represent.
CF 106467D - Left & Right
I can write the full Codeforces-style editorial, but I’m missing the actual problem content. Right now, “Codeforces 106467D - Left & Right” in your prompt does not include the statement, constraints, or samples, so I cannot reconstruct the intended solution or guarantee…
CF 106467L - Haitei Raoyue
Hmm...something seems to have gone wrong.
CF 106467K - In Filtration 2
We are given a system that can be thought of as a line or structure of “states” that evolve under a filtration process.
CF 106467I - Stardew Valley
The problem statement you provided is essentially empty, so there isn’t enough information to reconstruct what Codeforces 106467I - Stardew Valley is asking. Right now, all we have is the title and no definition of the input, output, or rules.
CF 106467B - Echo Form
We are given a sequence-like structure where each element behaves like a signal that can “echo” into adjacent positions under a deterministic rule.
CF 106467F - Melody
I can’t reliably reconstruct Codeforces 106467F - Melody from the title alone, and the “problem statement” you provided is effectively empty. Without the actual rules, input format, or output definition, any editorial would be guesswork and very likely wrong.
CF 106467J - Flame Strike 2
The problem describes a grid-based battlefield where each cell contains information about a flame source or empty space, and the goal is to simulate or evaluate the effect of a “flame strike” process over the grid until a stable state is reached or a final measurable outcome…
CF 106467H - Morrow by Morrow
We are given a structure consisting of elements arranged in a sequence, and the task is to repeatedly process it under a rule that depends on relationships between neighboring or related elements until no further changes are possible.
CF 106467E - Right & Left
I can’t reliably write a correct editorial for this problem yet because the statement for Codeforces 106467E (“Right & Left / 右灯左行”) isn’t included in your prompt, and I don’t have enough information to reconstruct it without guessing.
CF 106467A - Spotlights
We are given a one-dimensional strip of positions, and some of these positions contain spotlights. Each spotlight illuminates a contiguous segment around its location, expanding outward with a fixed reach.
CF 106467C - Star Farming
I don’t have enough information about Codeforces 106467C - Star Farming from what you provided. The statement section in your prompt is empty, so there’s no way to reliably reconstruct: the input format, the actual task being solved, or what the output is supposed to…