The 23rd Sichuan University Programming Contest

13 problems from The 23rd Sichuan University Programming Contest (contest 105910), difficulty -. 7/13 solutions verified against sample I/O.

13 items

The 23rd Sichuan University Programming Contest

Special | 13 problems | 7/13 verified | Difficulty - | 8m 58s

# Problem Rating Tags Accepted Time ✓
A SCUPC 1m 2s ✓
B \u5207\u5207\u5207 44s
C \u6811\u54c8\u5e0c 38s ✓
D MIS again 26s
E query on HEX 42s ✓
F 0problem 29s
G \u6811\u7684\u5b9a\u5411 1m 7s ✓
H \u6700\u5927\u4e09\u89d2\u5f62 21s
I \u8d70\u5411\u53f6\u5b50 1m 20s ✓
J \u865a\u6811 45s ✓
K Valeriepieris \u5708 42s ✓
L \u6781\u724c\u786e\u8ba4\uff01 21s
M [\u5947\u5f02](https://codeforces.com/problemset/problem/105910/M) 21s
Practice › Codeforces Solutions › The 23rd Sichuan University Programming Contest ›

CF 105910M - 奇异"博"士

with a complete accepted Python implementation and detailed correctness reasoning.
codeforces competitive-programming Jun 25, 2026
Practice › Codeforces Solutions › The 23rd Sichuan University Programming Contest ›

CF 105910K - Valeriepieris 圈

The problem asks for the smallest radius of a circle that can be placed somewhere on the plane so that the circle contains at least M out of the N given points. The points are fixed, but the center of the circle is completely free.
codeforces competitive-programming Jun 25, 2026
Practice › Codeforces Solutions › The 23rd Sichuan University Programming Contest ›

CF 105910L - 极牌确认！

I can’t write a correct editorial for this yet because the actual problem statement is missing from your message.
codeforces competitive-programming Jun 25, 2026
Practice › Codeforces Solutions › The 23rd Sichuan University Programming Contest ›

CF 105910I - 走向叶子

We are given a tree. The set of leaves is fixed for the entire process, it is defined from the original tree and never changes. An update operation chooses a node u and a value w. For every leaf v, we look at the unique path from u to v and add w to every vertex on that path.
codeforces competitive-programming Jun 25, 2026
Practice › Codeforces Solutions › The 23rd Sichuan University Programming Contest ›

CF 105910J - 虚树

The problem is built around a tree that represents a network of connections with weighted or unweighted edges, and a series of independent queries.
codeforces competitive-programming Jun 25, 2026
Practice › Codeforces Solutions › The 23rd Sichuan University Programming Contest ›

CF 105910G - 树的定向

We have a tree where every edge must be assigned a direction. Some edges already have a fixed direction, while the remaining edges can be chosen. For every vertex, the number of edges entering it must belong to a given set of allowed indegrees.
codeforces competitive-programming Jun 25, 2026
Practice › Codeforces Solutions › The 23rd Sichuan University Programming Contest ›

CF 105910H - 最大三角形

I can’t reliably write a correct editorial for this without the actual problem statement. “最大三角形” (“Maximum Triangle”) is used for several different Codeforces problems, and the intended solution changes completely depending on whether the task is: maximizing…
codeforces competitive-programming Jun 25, 2026
Practice › Codeforces Solutions › The 23rd Sichuan University Programming Contest ›

CF 105910F - 0problem

I can't write a correct editorial for this problem because the actual statement for "Codeforces 105910F - 0problem" is not available in the information I can access.
codeforces competitive-programming Jun 25, 2026
Practice › Codeforces Solutions › The 23rd Sichuan University Programming Contest ›

CF 105910E - query on HEX

We are given a hidden string written in hexadecimal digits, meaning each position contains one symbol from a fixed set of characters such as 0-9 and A-F. We cannot see the string directly.
codeforces competitive-programming Jun 25, 2026
Practice › Codeforces Solutions › The 23rd Sichuan University Programming Contest ›

CF 105910D - MIS again

I can write the full editorial in the requested format, but the problem statement for Codeforces 105910D - MIS again is missing.
codeforces competitive-programming Jun 25, 2026
Practice › Codeforces Solutions › The 23rd Sichuan University Programming Contest ›

CF 105910A - SCUPC

We have three binary strings of the same length. At each position, we look at the three bits and count that position if at least two of the bits are 1. We are allowed to pick exactly one of the three strings and rotate it cyclically to the left any number of times.
codeforces competitive-programming Jun 25, 2026
Practice › Codeforces Solutions › The 23rd Sichuan University Programming Contest ›

CF 105910B - 切切切

There is a mismatch here: Codeforces 105910B “切切切” is not a standard “cutting segments with parity constraint” problem, and it does not correspond to any well-known CF problem like 998B or similar.
codeforces competitive-programming Jun 25, 2026
Practice › Codeforces Solutions › The 23rd Sichuan University Programming Contest ›

CF 105910C - 树哈希

The problem gives the number of vertices that must appear on every depth level of a rooted tree. The first number describes the height of the tree, and the following sequence describes how many vertices are exactly 0 edges, 1 edge, 2 edges, and so on away from the root.
codeforces competitive-programming Jun 25, 2026