The 2025 Jiangsu Collegiate Programming Contest, The 2025 Guangdong Provincial Collegiate Programming Contest
12 problems from The 2025 Jiangsu Collegiate Programming Contest, The 2025 Guangdong Provincial Collegiate Programming Contest (contest 105945), difficulty -. 12/12 solutions verified against sample I/O.
The 2025 Jiangsu Collegiate Programming Contest, The 2025 Guangdong Provincial Collegiate Programming Contest
Special | 12 problems | 12/12 verified | Difficulty - | 15m 28s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | Matrix Game | 1m 22s | ✓ | |||
| B | Integer Generator | 1m 31s | ✓ | |||
| C | Cutting Cards | 1m 7s | ✓ | |||
| D | Spell Generation | 56s | ✓ | |||
| E | Grid Coloring | 1m 21s | ✓ | |||
| F | Ranking Prediction | 1m 11s | ✓ | |||
| G | Monetary System | 1m | ✓ | |||
| H | Loose Subsequences | 1m 9s | ✓ | |||
| I | Team Naming | 1m 44s | ✓ | |||
| J | Puzzle Competition | 1m 27s | ✓ | |||
| K | Typewriter | 1m 20s | ✓ | |||
| L | Route Selection | 1m 20s | ✓ |
CF 105945I - Team Naming
We are given $n$ people, and each person has a “name” made of three integers, which we can think of as a length-3 vector. We want to choose three distinct people $i, j, k$.
CF 105945J - Puzzle Competition
We are given a directed graph where each node represents a puzzle. Every node starts with zero “energy”, and each node has a threshold value. A node becomes unlocked as soon as the total energy it has accumulated reaches or exceeds its threshold.
CF 105945K - Typewriter
We are given a string that we want to reproduce using a peculiar typewriter mechanism. Instead of directly writing characters into the output, the machine reads from a template tape and copies into an output tape.
CF 105945H - Loose Subsequences
We are given a string and asked to count how many different non-empty subsequences we can form under a spacing restriction on positions.
CF 105945F - Ranking Prediction
A contest has already ended, and the scoreboard is frozen. You know your own team’s final result completely: how many problems you solved and your total penalty time.
CF 105945E - Grid Coloring
We are given a grid with exactly two rows and $n$ columns. Some cells already contain a color label, while the rest are empty. We must assign colors to the empty cells so that every cell is colored, and the precolored cells remain unchanged.
CF 105945B - Integer Generator
We are given a multiset of integers, but duplicates do not exist initially. Each number is a 30-bit mask. We are allowed to repeatedly pick any two currently available numbers and apply exactly one of three bitwise operations between them, XOR, AND, or OR, and then insert the…
CF 105945A - Matrix Game
We are given a binary matrix with up to a million rows but only up to ten columns. Each cell initially contains either zero or one. We are allowed to repeatedly flip entire rows or entire columns, where flipping means toggling every bit in that row or column.
CF 105945D - Spell Generation
We are given a very simple device that can generate a string of a required length, but it has two ways of operating, each consuming time. The first operation is a single tap. Each tap takes one second and produces exactly one unit of output length.
CF 105945L - Route Selection
We are given a very narrow weighted grid that represents a walking map. Movement happens along grid edges, and each edge has its own travel speed, so traversing different edges costs different amounts of time.
CF 105945G - Monetary System
We are given a strictly increasing sequence of coin denominations starting from 1. Using these coins, we define a deterministic way to “pay” any positive integer x: always use the largest possible coin first, take as many of it as possible, then move to smaller coins, and so…
CF 105945C - Cutting Cards
We are given a permutation of cards numbered from 1 to n, and we want to understand how many different “cutting procedures” can produce a given target sequence. A cutting procedure is not just a final arrangement rule, it is a constructive process.