The 21st UESTC Programming Contest Final

11 problems from The 21st UESTC Programming Contest Final (contest 104397), difficulty -. 5/11 solutions verified against sample I/O.

11 items

The 21st UESTC Programming Contest Final

Special | 11 problems | 5/11 verified | Difficulty - | 15m 54s

#	Problem	Time	✓
A	Inverse Pairs of Binary Strings	1m 26s	✓
B	Poker Number	4m 42s
C	Delivery Robot	47s
D	Binary Subsequence	37s
E	Course Selection	1m 18s	✓
F	`Mode'' but` Low Space''?	1m 14s	✓
G	Josephus Problem 2	44s
H	Morning ECO, Evening EMO	39s
I	W-shaped Rail Fence Cipher	1m 6s	✓
J	Billboard	1m 43s
K	Da Capo	1m 38s	✓

Practice › Codeforces Solutions › The 21st UESTC Programming Contest Final ›

CF 104397K - Da Capo

We are given a rectangular 3D region with dimensions $w times h times l$. The task is to completely partition this volume into a set of smaller axis-aligned boxes such that they exactly fill the original space without overlaps or gaps. Each small box is not arbitrary.

Practice › Codeforces Solutions › The 21st UESTC Programming Contest Final ›

CF 104397B - Poker Number

We are given a range of numbers from 1 to $n$. Some of these numbers are “special”: they are called Poker Numbers if they can be written as a positive multiple of a triangular number of the form $Tx = frac{x(x+1)}{2}$, where $x ge 2$.

Practice › Codeforces Solutions › The 21st UESTC Programming Contest Final ›

CF 104397J - Billboard

We are given a ranked list of songs, where each song initially sits at a unique position from 1 to n. For every song, we receive exactly one consolidated opinion about whether its current position is acceptable or should be changed.

Practice › Codeforces Solutions › The 21st UESTC Programming Contest Final ›

CF 104397I - W-shaped Rail Fence Cipher

We are given a string that needs to be rearranged according to a fixed “W-shaped” writing path. Instead of writing characters left to right in a single line, we imagine placing them along a vertical pattern with multiple rows, then reading them row by row.

Practice › Codeforces Solutions › The 21st UESTC Programming Contest Final ›

CF 104397H - Morning ECO, Evening EMO

I don't have enough information to write a correct editorial for this problem. The prompt identifies Codeforces 104397H - Morning ECO, Evening EMO, but the essential parts are missing: - Problem statement - Input specification - Output specification - Constraints - Sample…

Practice › Codeforces Solutions › The 21st UESTC Programming Contest Final ›

CF 104397E - Course Selection

We are given a set of selected courses for a master’s program. Each course contributes a certain number of credits and belongs to exactly one category such as public foundational, professional foundational, elective variants, or compulsory sessions.

Practice › Codeforces Solutions › The 21st UESTC Programming Contest Final ›

CF 104397G - Josephus Problem 2

I don't have enough information to write a correct editorial. The problem statement describes the task, but it does not provide the full input/output specification needed to derive and verify the algorithm.

Practice › Codeforces Solutions › The 21st UESTC Programming Contest Final ›

CF 104397A - Inverse Pairs of Binary Strings

We are given several binary strings and we are allowed to concatenate them in any order into a single long binary string. Once concatenated, we count inversions in the usual sense: a pair of positions where a 1 appears before a 0.

Practice › Codeforces Solutions › The 21st UESTC Programming Contest Final ›

CF 104397D - Binary Subsequence

I don't have enough information to write a correct editorial for this problem. The prompt includes the problem statement, but it does not include the key information needed to derive the algorithm, namely one of the following: 1. The original Codeforces editorial. 2.

Practice › Codeforces Solutions › The 21st UESTC Programming Contest Final ›

CF 104397C - Delivery Robot

The problem statement is missing a critical piece of information. The Input section in your prompt is empty, and the sample input has also lost all whitespace: This is impossible to parse unambiguously. For example, it could mean: or many other interpretations.

Practice › Codeforces Solutions › The 21st UESTC Programming Contest Final ›

CF 104397F - ``Mode'' but ``Low Space''?

We are given a collection of cookie sizes, essentially an array of integers. From this array, we want to select a subset of cookies such that the chosen elements lie within a narrow value range: the largest selected value minus the smallest selected value must be at most k.