2025 SiChuan University for new student

12 problems from 2025 SiChuan University for new student (contest 106260), difficulty -. 5/12 solutions verified against sample I/O.

12 items

2025 SiChuan University for new student

Special | 12 problems | 5/12 verified | Difficulty - | 7m 55s

# Problem Rating Tags Accepted Time ✓
A \u6811\uff0c\u6392\u5217\uff0c\u671f\u671b 26s
B \u56de\u6587 48s ✓
C backpack 1m 16s ✓
D four 23s
E five 44s
F six 31s
G seven 18s
H \u732b\u6811 28s
I K-4 1m ✓
J \u6392\u5217 48s ✓
K \u8c03\u548c\u7ea7\u6570\u6c42\u548c 21s
L \u8d27\u67b6\u8d27\u7269 52s ✓
Practice › Codeforces Solutions › 2025 SiChuan University for new student ›

CF 106260J - 排列

We are building strings of length $n$ using exactly four characters: $y, u, k, o$. The restriction is local: if you ever look at any consecutive block of 5 characters, that block must not be a permutation of the multiset formed by the letters of the word “yuuko”.
codeforces competitive-programming Jun 25, 2026
Practice › Codeforces Solutions › 2025 SiChuan University for new student ›

CF 106260K - 调和级数求和

I could not reliably recover the actual statement of Codeforces Gym 106260K from available sources. The title "调和级数求和" only indicates a harmonic-series summation problem, but the input format, required output, constraints, and exact quantity to compute are missing.
codeforces competitive-programming Jun 25, 2026
Practice › Codeforces Solutions › 2025 SiChuan University for new student ›

CF 106260H - 猫树

following your exact style and formatting requirements.
codeforces competitive-programming Jun 25, 2026
Practice › Codeforces Solutions › 2025 SiChuan University for new student ›

CF 106260G - seven

I can't reliably write a correct editorial for Codeforces 106260G - seven because the problem statement is missing from your prompt, and that Gym problem is not identifiable from the information provided. Please send one of the following: 1. The full problem statement, or 2.
codeforces competitive-programming Jun 25, 2026
Practice › Codeforces Solutions › 2025 SiChuan University for new student ›

CF 106260E - five

I could not reliably retrieve the exact statement of Codeforces 106260E - five from public sources, which usually means it is either an archived problem with limited indexing or a contest-specific statement not fully mirrored outside Codeforces.
codeforces competitive-programming Jun 25, 2026
Practice › Codeforces Solutions › 2025 SiChuan University for new student ›

CF 106260F - six

following all the style and formatting constraints you provided.
codeforces competitive-programming Jun 25, 2026
Practice › Codeforces Solutions › 2025 SiChuan University for new student ›

CF 106260C - backpack

We are given a directed graph of caverns and tunnels. We start in cavern 1 with zero rocks in the backpack and want to reach cavern n. A tunnel adds a rocks when we enter it, then removes b rocks when we leave it.
codeforces competitive-programming Jun 25, 2026
Practice › Codeforces Solutions › 2025 SiChuan University for new student ›

CF 106260D - four

I can write the editorial, but I need the actual problem details first. The statement section in your prompt is empty, and I could not reliably identify the problem from only “Codeforces 106260D - four”.
codeforces competitive-programming Jun 25, 2026
Practice › Codeforces Solutions › 2025 SiChuan University for new student ›

CF 106260B - 回文

We are given a rooted tree where each node carries a lowercase letter. The root is node 1, and every node has a well-defined depth from the root. Each query focuses on one node u and a target depth d.
codeforces competitive-programming Jun 25, 2026
Practice › Codeforces Solutions › 2025 SiChuan University for new student ›

CF 106260A - 树，排列，期望

Sure - send me the Codeforces problem statement (or link, if you have it), and I’ll write a detailed editorial in a competitive programming style.
codeforces competitive-programming Jun 25, 2026
Practice › Codeforces Solutions › 2025 SiChuan University for new student ›

CF 106260L - 货架货物

There are n storage locations, each connected by directed roads with travel costs, and there are m product types. Every product type is distributed across all warehouses in different quantities.
codeforces competitive-programming Jun 18, 2026
Practice › Codeforces Solutions › 2025 SiChuan University for new student ›

CF 106260I - K-4

We are given a tree whose vertices carry nonnegative weights. The operation we are allowed to perform is to remove edges, which splits the tree into several connected components.
codeforces competitive-programming Jun 18, 2026