The 22nd Sichuan University Programming Contest

13 problems from The 22nd Sichuan University Programming Contest (contest 105174), difficulty -. 9/13 solutions verified against sample I/O.

13 items

The 22nd Sichuan University Programming Contest

Special | 13 problems | 9/13 verified | Difficulty - | 11m 5s

# Problem Rating Tags Accepted Time ✓
A \u914d\u5bf9\u8d28\u6570 1m 12s ✓
B \u95ee\u8def 53s ✓
C \u5927\u9b54\u6cd5\u5e08 1m ✓
D \u731c 01 \u4e32 56s ✓
E \u9b54\u65b9 32s
F \u6eb6\u6db2\u914d\u5236 \u2160 50s ✓
G \u6eb6\u6db2\u914d\u5236 \u2161 31s
H \u6570 01 \u4e32 50s ✓
I Mai \u8bed\u8a00 1m 4s ✓
J \u4f20\u9001 30s
K \u5faa\u73af\u5c0f\u6570 37s
L \u9053\u8def 58s ✓
M \u77f3\u5b50\u6e38\u620f 1m 12s ✓
Practice › Codeforces Solutions › The 22nd Sichuan University Programming Contest ›

CF 105174M - 石子游戏

We are given a game with a pile of stones. Two players alternate turns, Alice moving first. On each turn, the player looks at the current number of stones, say x, and removes stones according to a rule that depends on parity.
codeforces competitive-programming Jun 27, 2026
Practice › Codeforces Solutions › The 22nd Sichuan University Programming Contest ›

CF 105174L - 道路

We are given a rooted tree with root at city 1. Every other city is connected so that there is exactly one simple path between any two cities. The cities that matter for the king’s yearly trips are the border cities, meaning the leaves of the tree except the root itself.
codeforces competitive-programming Jun 27, 2026
Practice › Codeforces Solutions › The 22nd Sichuan University Programming Contest ›

CF 105174K - 循环小数

I can't write a correct editorial for this problem because the problem statement in your prompt is incomplete and internally inconsistent. The sample input is corrupted: while the statement says each test case contains four integers a s b t after an initial T.
codeforces competitive-programming Jun 27, 2026
Practice › Codeforces Solutions › The 22nd Sichuan University Programming Contest ›

CF 105174I - Mai 语言

We are asked to construct a small “program file” made of exactly $n$ lines. Each line has a very rigid format: it starts with a number written inside braces, then followed by a sequence of commas.
codeforces competitive-programming Jun 27, 2026
Practice › Codeforces Solutions › The 22nd Sichuan University Programming Contest ›

CF 105174H - 数 01 串

We start with a binary string, a sequence made only of 0 and 1. Two kinds of local edit operations are allowed, and each operation inserts one extra character between two adjacent positions. The first operation is only usable on a pair of equal neighbors.
codeforces competitive-programming Jun 27, 2026
Practice › Codeforces Solutions › The 22nd Sichuan University Programming Contest ›

CF 105174J - 传送

The problem statement is incomplete for writing a correct editorial and reference solution. The most important issue is that the sample shown is malformed: while the statement says the first number is T, yet this sample cannot be parsed as multiple test cases.
codeforces competitive-programming Jun 27, 2026
Practice › Codeforces Solutions › The 22nd Sichuan University Programming Contest ›

CF 105174G - 溶液配制 Ⅱ

I don't have enough information to write a correct editorial or produce a correct solution for this problem. The statement you've provided is corrupted in a crucial place.
codeforces competitive-programming Jun 27, 2026
Practice › Codeforces Solutions › The 22nd Sichuan University Programming Contest ›

CF 105174F - 溶液配制 Ⅰ

We are given $n$ bottles, each containing a solution with a fixed concentration $wi$. For every query, we are asked how many subsets of these bottles can be mixed to obtain a solution with an exact target concentration $x$.
codeforces competitive-programming Jun 27, 2026
Practice › Codeforces Solutions › The 22nd Sichuan University Programming Contest ›

CF 105174D - 猜 01 串

We are given an unknown binary string of length $n$, consisting only of characters 0 and 1. We cannot see it directly.
codeforces competitive-programming Jun 27, 2026
Practice › Codeforces Solutions › The 22nd Sichuan University Programming Contest ›

CF 105174E - 魔方

I don't have enough information to write a correct editorial and solution for this problem because the problem statement in your prompt is incomplete. The critical part that is missing is the table describing the cube notation.
codeforces competitive-programming Jun 27, 2026
Practice › Codeforces Solutions › The 22nd Sichuan University Programming Contest ›

CF 105174A - 配对质数

We are given multiple test cases. In each test case, we take the numbers from 1 up to 2n and must split them into exactly n disjoint pairs. The constraint is that for every chosen pair, the sum of its two elements must be a prime number.
codeforces competitive-programming Jun 27, 2026
Practice › Codeforces Solutions › The 22nd Sichuan University Programming Contest ›

CF 105174C - 大魔法师

The wand has exactly n gem slots. There are three independent categories of gems. The first category increases magic attack, the second increases mana, and the third increases attack speed.
codeforces competitive-programming Jun 27, 2026
Practice › Codeforces Solutions › The 22nd Sichuan University Programming Contest ›

CF 105174B - 问路

We are simulating a movement on the surface of a sphere, where the traveler starts somewhere on the equator of a spherical Earth with radius $R$.
codeforces competitive-programming Jun 27, 2026