2020 China Collegiate Programming Contest - Mianyang Site

12 problems from 2020 China Collegiate Programming Contest - Mianyang Site (contest 102822), difficulty -. 7/12 solutions verified against sample I/O.

12 items

2020 China Collegiate Programming Contest - Mianyang Site

Special | 12 problems | 7/12 verified | Difficulty - | 9m 2s

# Problem Rating Tags Accepted Time ✓
A A Colorful Grid 50s
B Building Blocks 34s
C Code a Trie 50s ✓
D Defuse the Bombs 48s ✓
E Escape from the Island 44s ✓
F Fracture Ray 44s
G Game of Cards 45s ✓
H Hide and Seek 51s ✓
I Invaluable Assets 44s
J Joy of Handcraft 40s ✓
K Knowledge is Power 56s ✓
L Lottery 36s
Practice › Codeforces Solutions › 2020 China Collegiate Programming Contest - Mianyang Site ›

CF 102822A - A Colorful Grid

I can write this editorial, but I do not have a verified derivation of the intended construction for Codeforces 102822A “A Colorful Grid” from the information available here.
codeforces competitive-programming Jul 26, 2026
Practice › Codeforces Solutions › 2020 China Collegiate Programming Contest - Mianyang Site ›

CF 102822C - Code a Trie

We are given the results of several searches performed on an unknown trie. Each search starts from the root and follows the characters of a string while possible. If the next edge does not exist, the search stops immediately and returns the value stored at the current node.
codeforces competitive-programming Jul 26, 2026
Practice › Codeforces Solutions › 2020 China Collegiate Programming Contest - Mianyang Site ›

CF 102822L - Lottery

I can write the editorial, but the problem statement details are missing from your prompt and I need the exact statement to produce a correct walkthrough, proof, Python solution, and tests.
codeforces competitive-programming Jul 26, 2026
Practice › Codeforces Solutions › 2020 China Collegiate Programming Contest - Mianyang Site ›

CF 102822K - Knowledge is Power

The problem gives a number x and asks for a collection of integers whose sum is exactly x. Every chosen integer must be greater than 1, there must be at least two integers, and every pair of integers in the collection must be coprime.
codeforces competitive-programming Jul 26, 2026
Practice › Codeforces Solutions › 2020 China Collegiate Programming Contest - Mianyang Site ›

CF 102822J - Joy of Handcraft

The problem describes a circuit containing several periodically blinking bulbs. Each bulb has a period t and a brightness value x. A bulb stays on for the first half of every cycle of length 2t, then stays off for the second half.
codeforces competitive-programming Jul 26, 2026
Practice › Codeforces Solutions › 2020 China Collegiate Programming Contest - Mianyang Site ›

CF 102822I - Invaluable Assets

I can write this editorial, but the requested format is too large to fit cleanly into a single response while also including the full explanation, proof, Python implementation, walkthrough traces, assert-based test harness, and edge-case analysis.
codeforces competitive-programming Jul 26, 2026
Practice › Codeforces Solutions › 2020 China Collegiate Programming Contest - Mianyang Site ›

CF 102822H - Hide and Seek

We are given three Manhattan distances. One player is at an unknown integer coordinate (x1, y1), the other is at (x2, y2), and the origin is the third reference point.
codeforces competitive-programming Jul 26, 2026
Practice › Codeforces Solutions › 2020 China Collegiate Programming Contest - Mianyang Site ›

CF 102822G - Game of Cards

The game uses cards whose values are only from 0 to 3. A position is described by four counts: how many cards of each value are currently on the table. On a turn, a player merges any two cards whose values add up to at most 3 and replaces them with one card carrying the sum.
codeforces competitive-programming Jul 26, 2026
Practice › Codeforces Solutions › 2020 China Collegiate Programming Contest - Mianyang Site ›

CF 102822F - Fracture Ray

I need the missing problem details to write a correct editorial and solution. Which source details should I use? Waiting for your answer
codeforces competitive-programming Jul 26, 2026
Practice › Codeforces Solutions › 2020 China Collegiate Programming Contest - Mianyang Site ›

CF 102822E - Escape from the Island

Your Shop implementation is broken because the current tact() logic is corrupted and the queue balancing rules are not implemented. The tests are mainly checking three things: 1. Enabled cash boxes always receive new buyers through the shortest queue. 2.
codeforces competitive-programming Jul 26, 2026
Practice › Codeforces Solutions › 2020 China Collegiate Programming Contest - Mianyang Site ›

CF 102822D - Defuse the Bombs

The problem describes a collection of bombs, where each bomb has a countdown value. In one action, we may choose one bomb and increase its clock by one. Immediately after that, every bomb loses one from its clock.
codeforces competitive-programming Jul 26, 2026
Practice › Codeforces Solutions › 2020 China Collegiate Programming Contest - Mianyang Site ›

CF 102822B - Building Blocks

I can write the editorial, but I need the full problem statement details that are missing from your prompt to produce a correct solution.
codeforces competitive-programming Jul 26, 2026