2022 Collegiate Programming Contest of Xiangtan University

10 problems from 2022 Collegiate Programming Contest of Xiangtan University (contest 103765), difficulty -. 10/10 solutions verified against sample I/O.

10 items

2022 Collegiate Programming Contest of Xiangtan University

Special | 10 problems | 10/10 verified | Difficulty - | 9m 15s

# Problem Rating Tags Accepted Time ✓
A \u793e\u56e2\u62db\u65b0 56s ✓
B \u5b57\u7b26\u4e32 47s ✓
C \u6392\u7403 1m 15s ✓
D \u9999\u8549 1m 11s ✓
E \u5b64\u72ec\u7684\u5c0fZ 55s ✓
F \u6458\u6a58\u5b50 50s ✓
G \u6392\u5217 55s ✓
H \u7d27\u6025\u8865\u7ed9 47s ✓
I \u7ebf\u6bb5\u4e0e\u5e73\u9762 51s ✓
J \u5728\u4e00\u8d77 48s ✓
Practice › Codeforces Solutions › 2022 Collegiate Programming Contest of Xiangtan University ›

CF 103765J - 在一起

We are given a network of cities connected by roads, where the structure forms a tree. Every city may contain several ACMers, and each person wants to attend a gathering held in exactly one city.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › 2022 Collegiate Programming Contest of Xiangtan University ›

CF 103765I - 线段与平面

We are given a collection of straight line segments drawn on an infinite plane. Each segment is defined by two endpoints with integer coordinates. As more segments are added, they intersect each other at most once per pair, and possibly only at endpoints or not at all.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › 2022 Collegiate Programming Contest of Xiangtan University ›

CF 103765H - 紧急补给

We are working on a grid of integer lattice points forming an $(N+1)times(N+1)$ square. Some of these grid points are marked as supply depots. Each depot is equally likely to be chosen. Independently, Tanya’s starting position is also a uniformly random grid point.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › 2022 Collegiate Programming Contest of Xiangtan University ›

CF 103765G - 排列

We are asked whether we can construct two permutations of the same length, but drawn from two different value ranges, such that each index forms a pair with a very rigid arithmetic constraint. One array is a permutation of the integers from 1 to N.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › 2022 Collegiate Programming Contest of Xiangtan University ›

CF 103765F - 摘橘子

We are given several independent scenarios of an orange orchard. In each scenario, there are $n$ trees, and the $i$-th tree contains $ai$ oranges. From each tree, we are allowed to pick any integer number of oranges between $0$ and $ai$, independently of other trees.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › 2022 Collegiate Programming Contest of Xiangtan University ›

CF 103765E - 孤独的小Z

We are given a system of constraints over an array of values, one value per city. Each city $i$ has a non-negative integer $xi$, representing the number of friends in that city.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › 2022 Collegiate Programming Contest of Xiangtan University ›

CF 103765D - 香蕉

We are given a scenario where there are $n$ identical bananas and $m$ monkeys. Every monkey must receive at least one banana, so we are really distributing $n$ into $m$ positive integers $a1, a2, dots, am$ with total sum fixed.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › 2022 Collegiate Programming Contest of Xiangtan University ›

CF 103765C - 排球

We are given the total number of points scored by two volleyball teams across an entire match, but we are not told how those points are distributed across individual sets or who won each set.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › 2022 Collegiate Programming Contest of Xiangtan University ›

CF 103765B - 字符串

We are given a game played on a single string of lowercase letters. Two players alternate turns, starting with the first player.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › 2022 Collegiate Programming Contest of Xiangtan University ›

CF 103765A - 社团招新

We are given a set of students, each student being distinguishable but otherwise identical in role. We are allowed to form multiple groups, where each group is just a chosen subset of these students. Each group must satisfy two structural constraints.
codeforces competitive-programming Jul 2, 2026