The 2025 Shanghai Collegiate Programming Contest

13 problems from The 2025 Shanghai Collegiate Programming Contest (contest 105992), difficulty -. 13/13 solutions verified against sample I/O.

13 items

The 2025 Shanghai Collegiate Programming Contest

Special | 13 problems | 13/13 verified | Difficulty - | 14m 42s

#	Problem	Time	✓
A	\u5e8f\u5217	56s	✓
B	\u5ba1\u5224	1m 17s	✓
C	\u997a\u5b50	1m 20s	✓
D	\u4e0e\u6216\u535a\u5f08	1m	✓
E	Djangle \u7684\u6570\u636e\u7ed3\u6784	54s	✓
F	No explanation	1m 24s	✓
G	\u77e9\u9635	1m 17s	✓
H	V \u6211 112.5	47s	✓
I	\u771f\u76f8	54s	✓
J	\u753b\u5708	1m 14s	✓
K	\u795e\u4e4b\u4e00\u624b	1m 25s	✓
L	\u8ff7\u5bab	1m 3s	✓
M	\u9b54\u6cd5\u4f7f\u8003\u6838	1m 11s	✓

Practice › Codeforces Solutions › The 2025 Shanghai Collegiate Programming Contest ›

CF 105992M - 魔法使考核

We are given an array of $n$ magical orbs, all starting at value zero. The goal is to transform them into a target array $a$, where each position $i$ must end exactly at $ai$. Two operations are available.

Practice › Codeforces Solutions › The 2025 Shanghai Collegiate Programming Contest ›

CF 105992K - 神之一手

We are simulating a probabilistic board process that runs over many rounds, where each round can instantly end the game depending on rare failure events.

Practice › Codeforces Solutions › The 2025 Shanghai Collegiate Programming Contest ›

CF 105992J - 画圈

We are given an undirected simple graph where each edge is labeled either white or black. The graph is connected when we ignore colors. One operation lets us pick any simple cycle in the graph, with the restriction that the cycle must contain at least one white edge.

Practice › Codeforces Solutions › The 2025 Shanghai Collegiate Programming Contest ›

CF 105992I - 真相

We are given a rooted tree with root fixed at node 1. Each node has a person who permanently behaves in one of two ways: either they always tell the truth or they always lie.

Practice › Codeforces Solutions › The 2025 Shanghai Collegiate Programming Contest ›

CF 105992G - 矩阵

We are asked to fill an $n times n$ grid with distinct positive integers, all bounded by about $n^2 + 40n$, so essentially a tight range just slightly larger than the number of cells.

Practice › Codeforces Solutions › The 2025 Shanghai Collegiate Programming Contest ›

CF 105992H - V 我 112.5

We are given a single integer x, which represents a percentage tax or surcharge applied to a fixed base cost. The base cost is always 50 units. The final amount to pay is the base cost plus an additional percentage of that base cost.

Practice › Codeforces Solutions › The 2025 Shanghai Collegiate Programming Contest ›

CF 105992E - Djangle 的数据结构

We are maintaining an array of positive integers under two types of range operations. The first operation replaces every element in a segment with a fixed value.

Practice › Codeforces Solutions › The 2025 Shanghai Collegiate Programming Contest ›

CF 105992C - 饺子

We are given several independent datasets. In each dataset there are multiple kinds of dumplings. Each kind has a limited supply, and each eaten dumpling from that kind gives a reward that decreases as you keep eating more from the same kind.

Practice › Codeforces Solutions › The 2025 Shanghai Collegiate Programming Contest ›

CF 105992B - 审判

We are given a large number of attack types, say $k$ of them. A “scenario” is defined by a vector of non-negative integers $(a1, a2, dots, ak)$, where each $ai$ is at most $n$, and the total sum $a1 + cdots + ak$ does not exceed $M$.

Practice › Codeforces Solutions › The 2025 Shanghai Collegiate Programming Contest ›

CF 105992D - 与或博弈

We are given two non-negative integers a and b, and a target pair x and y. Two players alternate turns, with the first player (gsh) trying to transform the current state into exactly (x, y) within a bounded number of moves, while the opponent (AI) tries to prevent this from…

Practice › Codeforces Solutions › The 2025 Shanghai Collegiate Programming Contest ›

CF 105992L - 迷宫

The grid describes a rectangular maze where every cell contains a fixed mirror that deterministically redirects a moving ball depending on the direction from which it enters.

Practice › Codeforces Solutions › The 2025 Shanghai Collegiate Programming Contest ›

CF 105992F - No explanation

We are given a collection of strings made of lowercase letters. We may choose any subset of these strings and arrange the chosen ones in any order. After concatenation, we obtain a single long string $S$.

Practice › Codeforces Solutions › The 2025 Shanghai Collegiate Programming Contest ›

CF 105992A - 序列

We are given a target integer $x$, and we must construct a sequence $a$ of positive integers such that a particular combinational sum over its subsequences equals exactly $x$. For any sequence, we define $f(x)$ as the number of distinct values appearing in a sequence $x$.