2025 National Invitational of CCPC (Zhengzhou), 2025 CCPC Henan Provincial Collegiate Programming Contest
13 problems from 2025 National Invitational of CCPC (Zhengzhou), 2025 CCPC Henan Provincial Collegiate Programming Contest (contest 105941), difficulty -. 13/13 solutions verified against sample I/O.
2025 National Invitational of CCPC (Zhengzhou), 2025 CCPC Henan Provincial Collegiate Programming Contest
Special | 13 problems | 13/13 verified | Difficulty - | 14m 54s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | Toxel \u4e0e\u72ec\u4e00\u65e0\u4e8c\u7684\u5e8f\u5217 | 1m 40s | ✓ | |||
| B | \u968f\u673a\u6808 II | 1m 14s | ✓ | |||
| C | Toxel \u4e0e\u5b9d\u53ef\u68a6\u56fe\u9274 | 1m 1s | ✓ | |||
| D | 2025 | 59s | ✓ | |||
| E | \u53cc\u751f\u9b54\u5492 | 56s | ✓ | |||
| F | \u5e7b\u5f62\u4e4b\u8def | 1m 13s | ✓ | |||
| G | \u76f4\u5f84\u4e0e\u6700\u5927\u72ec\u7acb\u96c6 | 59s | ✓ | |||
| H | \u6811\u8bba\u51fd\u6570 | 1m 14s | ✓ | |||
| I | \u6709\u7684\u5144\u5f1f\uff0c\u6709\u7684 | 1m 1s | ✓ | |||
| J | Ring Trick | 53s | ✓ | |||
| K | Ring Trick II | 1m 20s | ✓ | |||
| L | Astral Decay | 1m 24s | ✓ | |||
| M | \u5ddd\u9640\u822a\u7a7a\u5b66\u9662 | 1m | ✓ |
CF 105941L - Astral Decay
We are given a set of points on a 2D plane. We must pick three points, allowing reuse of the same point, and designate them as A, B, and C. From A, we form two vectors pointing to B and to C, and we want to minimize the dot product of those two vectors.
CF 105941K - Ring Trick II
We are given a sequence of length $n$, where each element is an integer in the range $[0, m-1]$. The key operation allowed is a global cyclic shift: we choose a single integer $k$, and every element $ai$ is replaced by $(ai + k) bmod m$.
CF 105941J - Ring Trick
We are given a string consisting only of uppercase English letters. We are allowed to apply a single global Caesar shift: pick an integer shift $k$, then every character is rotated forward by $k$ positions in the alphabet modulo 26.
CF 105941I - 有的兄弟，有的
We are given a system of players, each initially belonging to some faction. During the hidden part of the process, players repeatedly fight.
CF 105941H - 树论函数
We are given a rule that builds an infinite undirected graph over positive integers. Each integer is a node. For a node $n$, we define a value $f(n) = n(n+1)$.
CF 105941G - 直径与最大独立集
We are asked to construct a tree on $n$ vertices so that two quantities become equal: the size of a maximum independent set and the diameter length of the tree. A maximum independent set is a largest possible set of vertices where no two chosen vertices share an edge.
CF 105941E - 双生魔咒
We are given 2n strings made of lowercase letters. We must split them into two groups of equal size, think of one group as “prefix side” strings and the other as “suffix side” strings. After that, we pair the two groups arbitrarily in a one-to-one matching.
CF 105941A - Toxel 与独一无二的序列
We are given several test cases. Each test case provides an array of length $n$, where every element is an integer between $1$ and $n$.
CF 105941B - 随机栈 II
We are given a sequence of operations on a multiset that starts empty. Each operation is either inserting a value or removing one element chosen uniformly at random from the current multiset.
CF 105941D - 2025
We are given a single integer representing a year, and we need to decide whether it satisfies a very specific numeric property. The year is valid if two conditions hold simultaneously.
CF 105941M - 川陀航空学院
We are given an undirected graph with n nodes and m existing connections. Because the system is damaged, these connections may include duplicates, cycles, and even useless self-loops.
CF 105941F - 幻形之路
We are given a rectangular grid where each cell is either empty or blocked. You start at the top-left cell and want to reach the bottom-right cell, moving in the four cardinal directions without leaving the grid. Normally, movement is only allowed through empty cells.
CF 105941C - Toxel 与宝可梦图鉴
We are given an array of length $n$, where each position stores a Pokémon type represented by an integer. The array changes over time through a sequence of operations.