2024 XTU Summer Camp Selection Competition

6 problems from 2024 XTU Summer Camp Selection Competition (contest 105266), difficulty -. 6/6 solutions verified against sample I/O.

6 items

2024 XTU Summer Camp Selection Competition

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

#	Problem	Time	✓
A	\u6700\u5927\u516c\u7ea6\u6570\u4e0e\u548c	53s	✓
B	\u6309\u4f4d\u6216	1m 8s	✓
C	\u91cd\u91cfII	55s	✓
D	\u5b50\u4e32	1m 23s	✓
E	\u7ffb\u8f6c	48s	✓
F	\u9996\u53d1\u9635\u5bb9	57s	✓

Practice › Codeforces Solutions › 2024 XTU Summer Camp Selection Competition ›

CF 105266C - 重量II

We are given several test cases. In each case, there are several types of weights, and each type has an unlimited supply. However, there is a restriction in how we use them: all chosen weights must be placed on the same side of a balance scale.

Practice › Codeforces Solutions › 2024 XTU Summer Camp Selection Competition ›

CF 105266F - 首发阵容

There are five fixed roles that must be filled by exactly five distinct players. Each player comes with a constraint encoded as a length-5 binary string, where a 1 indicates that the player is capable of playing the corresponding role.

Practice › Codeforces Solutions › 2024 XTU Summer Camp Selection Competition ›

CF 105266D - 子串

We are given a string consisting of lowercase English letters. For each test case, we must choose two substrings that do not overlap in the original string.

Practice › Codeforces Solutions › 2024 XTU Summer Camp Selection Competition ›

CF 105266E - 翻转

We are given two arrays of equal length. We start with array a, and we are allowed to optionally choose a single contiguous segment and reverse it. After performing this operation at most once, we compare the resulting array with a fixed array b of the same length.

Practice › Codeforces Solutions › 2024 XTU Summer Camp Selection Competition ›

CF 105266B - 按位或

We are given several test cases. In each test case there is an array of integers, and we are allowed to reorder it arbitrarily. After choosing a permutation, we look at all split points of the permuted array.

Practice › Codeforces Solutions › 2024 XTU Summer Camp Selection Competition ›

CF 105266A - 最大公约数与和

We are given a sequence of positive integers and asked to count how many contiguous subarrays satisfy a simple-looking inequality involving two classical range functions: the greatest common divisor of all elements in the subarray and the sum of all elements in the same subarray.