The 2024 Shanghai Collegiate Programming Contest

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

13 items

The 2024 Shanghai Collegiate Programming Contest

Special | 13 problems | 12/13 verified | Difficulty - | 20m 15s

# Problem Rating Tags Accepted Time ✓
A \u65e0\u7ebf\u7f51\u7edc\u6574\u70b9\u6805\u683c\u7edf\u8ba1 1m 8s ✓
B \u5f02\u6216\u548c\u4e4b\u548c 1m 2s ✓
C \u65e0\u7ebf\u57fa\u7ad9\u6700\u4f73\u9009\u5740 1m 17s ✓
D \u54b8\u9c7c\u8dd1\u9177 1m 16s ✓
E \u65e0\u7ebf\u8f6f\u4ef6\u65e5 48s ✓
F \u7f81\u7eca\u5927\u5e08 1m 9s ✓
G \u8c61\u68cb\u5927\u5e08 1m 4s ✓
H \u51fa\u91d1\u8bb0\u5f55 1m 28s ✓
I \u516d\u5143\u7ec4\u8ba1\u6570 5m 34s
J \u6781\u7b80\u5408\u6570\u5e8f\u5217 53s ✓
K \u65f6\u5149 2m 24s ✓
L \u6269\u6563\u6a21\u578b 1m 9s ✓
M \u4e0d\u5171\u6234\u5929 1m 3s ✓
Practice › Codeforces Solutions › The 2024 Shanghai Collegiate Programming Contest ›

CF 105229I - 六元组计数

Codeforces 105229I: 六元组计数
codeforces competitive-programming Jun 24, 2026
Practice › Codeforces Solutions › The 2024 Shanghai Collegiate Programming Contest ›

CF 105229K - 时光

We are given a set of missions, each mission i has a cost of time Ai and a value Bi. A person has a total time budget M and can choose a subset of missions to complete, each at most once, in any order, as long as the total time spent does not exceed M.
codeforces competitive-programming Jun 24, 2026
Practice › Codeforces Solutions › The 2024 Shanghai Collegiate Programming Contest ›

CF 105229M - 不共戴天

We are given a line of $n$ water lilies labeled from left to right. We need to design two independent directed systems of connections on these positions. The first system belongs to a frog.
codeforces competitive-programming Jun 24, 2026
Practice › Codeforces Solutions › The 2024 Shanghai Collegiate Programming Contest ›

CF 105229L - 扩散模型

We are given a rooted tree where each node represents a state in a diffusion process. Starting from the root, a token moves downward until it reaches a leaf.
codeforces competitive-programming Jun 24, 2026
Practice › Codeforces Solutions › The 2024 Shanghai Collegiate Programming Contest ›

CF 105229J - 极简合数序列

We are given several independent test cases. Each test case provides an array of positive integers. From this array we consider every contiguous segment and compute its sum.
codeforces competitive-programming Jun 24, 2026
Practice › Codeforces Solutions › The 2024 Shanghai Collegiate Programming Contest ›

CF 105229H - 出金记录

We are observing a gacha system that produces a sequence of “gold intervals”. Each interval is the number of draws between two consecutive gold pulls, and that interval is a random variable whose distribution depends on a counter that evolves during the same interval.
codeforces competitive-programming Jun 24, 2026
Practice › Codeforces Solutions › The 2024 Shanghai Collegiate Programming Contest ›

CF 105229G - 象棋大师

We are asked to count how many monotone paths exist on an $n times n$ grid from the bottom-left corner $(0,0)$ to the top-right corner $(n,n)$, where each move increases either the x-coordinate or the y-coordinate by exactly one.
codeforces competitive-programming Jun 24, 2026
Practice › Codeforces Solutions › The 2024 Shanghai Collegiate Programming Contest ›

CF 105229F - 羁绊大师

Each hero comes with two labels, think of them as two “bond types”. Every bond type appears on at most two heroes in total. A bond becomes active only when both heroes that contain it are selected.
codeforces competitive-programming Jun 24, 2026
Practice › Codeforces Solutions › The 2024 Shanghai Collegiate Programming Contest ›

CF 105229D - 咸鱼跑酷

We are given a line of positions, and at every position there are two possible “actions” available. Each action is either an addition of a fixed value or a multiplication by a fixed value.
codeforces competitive-programming Jun 24, 2026
Practice › Codeforces Solutions › The 2024 Shanghai Collegiate Programming Contest ›

CF 105229E - 无线软件日

We are given a long sequence of letters, and we are allowed to freely rearrange any of them after “cutting” them out of the original text.
codeforces competitive-programming Jun 24, 2026
Practice › Codeforces Solutions › The 2024 Shanghai Collegiate Programming Contest ›

CF 105229C - 无线基站最佳选址

We are given a set of points on the plane, and we must cover every point using exactly two geometric covering devices. One device is a circle and the other is a square.
codeforces competitive-programming Jun 24, 2026
Practice › Codeforces Solutions › The 2024 Shanghai Collegiate Programming Contest ›

CF 105229A - 无线网络整点栅格统计

We are working on a grid of integer lattice points inside a rectangle from (0, 0) to (n, m). For every lattice point (a, b), we must count how many distinct geometric squares can be formed such that (a, b) is one of the four vertices and all four vertices lie inside the…
codeforces competitive-programming Jun 24, 2026
Practice › Codeforces Solutions › The 2024 Shanghai Collegiate Programming Contest ›

CF 105229B - 异或和之和

We are given a tree where each node stores an integer weight. For any two nodes, we can look at the unique path between them and compute the bitwise XOR of all node weights along that path.
codeforces competitive-programming Jun 24, 2026