2024 Xiangtan University Summer Camp-Div.2

6 problems from 2024 Xiangtan University Summer Camp-Div.2 (contest 105323), difficulty -. 4/6 solutions verified against sample I/O.

6 items

2024 Xiangtan University Summer Camp-Div.2

Special | 6 problems | 4/6 verified | Difficulty - | 14m 51s

# Problem Rating Tags Accepted Time ✓
A \u4e8c\u5ea6\u6811\u4e0a\u7684\u67d3\u8272\u6e38\u620f 1m 1s ✓
B \u5c0f\u6587\u7684\u6392\u5217 1m 6s ✓
C gcd hard version 5m 23s
D \u6218\u81f3\u7ec8\u7ae0 1m 11s ✓
E LOL 53s ✓
F 810975 5m 17s
Practice › Codeforces Solutions › 2024 Xiangtan University Summer Camp-Div.2 ›

CF 105323B - 小文的排列

We are given a long sequence $S$ that is constructed in a very specific way. Each operation takes the numbers from $1$ to $m$, randomly permutes them, and appends that permutation to the end of $S$.
codeforces competitive-programming Jun 22, 2026
Practice › Codeforces Solutions › 2024 Xiangtan University Summer Camp-Div.2 ›

CF 105323D - 战至终章

We are given a set of nodes, each representing a demon. Every node has a required strength threshold, a reward strength increase, and a set of prerequisite “keys”.
codeforces competitive-programming Jun 22, 2026
Practice › Codeforces Solutions › 2024 Xiangtan University Summer Camp-Div.2 ›

CF 105323F - 810975

Codeforces 105323F: 810975
codeforces competitive-programming Jun 22, 2026
Practice › Codeforces Solutions › 2024 Xiangtan University Summer Camp-Div.2 ›

CF 105323C - gcd hard version

Codeforces 105323C: gcd hard version
codeforces competitive-programming Jun 22, 2026
Practice › Codeforces Solutions › 2024 Xiangtan University Summer Camp-Div.2 ›

CF 105323E - LOL

We are given a string consisting only of two characters, L and O. Over this string we must support two kinds of operations on any contiguous substring.
codeforces competitive-programming Jun 22, 2026
Practice › Codeforces Solutions › 2024 Xiangtan University Summer Camp-Div.2 ›

CF 105323A - 二度树上的染色游戏

We are given a rooted tree where every node has at most two children. The root is node 1, and each node has an associated weight. Initially only the root is colored red, all other nodes are white. The process evolves in discrete rounds.
codeforces competitive-programming Jun 22, 2026