The 2023 Zhejiang SCI-TECH University Freshman Programming Contest
14 problems from The 2023 Zhejiang SCI-TECH University Freshman Programming Contest (contest 104833), difficulty -. 14/14 solutions verified against sample I/O.
The 2023 Zhejiang SCI-TECH University Freshman Programming Contest
Special | 14 problems | 14/14 verified | Difficulty - | 12m 28s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | Locked Calculator | 1m 1s | ✓ | |||
| B | \u304a\u306f\u3088\u3046 \u5b66\u5f1f | 1m 1s | ✓ | |||
| C | \u304a\u306f\u3088\u3046 \u5b66\u59b9 | 53s | ✓ | |||
| D | LR SORT | 54s | ✓ | |||
| E | \u6211\u8981\u6253 k \u4e2a | 1m 7s | ✓ | |||
| F | \u820c\u5207\u96c0\uff08Easy Version\uff09 | 42s | ✓ | |||
| G | \u820c\u5207\u96c0\uff08Hard Version\uff09 | 51s | ✓ | |||
| H | Sterling | 50s | ✓ | |||
| I | A = B | 57s | ✓ | |||
| J | Devil's Recitation \u2160 | 50s | ✓ | |||
| K | Devil's Recitation \u2161 | 1m 2s | ✓ | |||
| L | \u5140\u7a81\u9aa8\u4e4b\u6b7b | 43s | ✓ | |||
| M | \u6e1a\u5343\u590f\u7684\u4e32 | 55s | ✓ | |||
| N | \u6842\u6797\u7cbe\u516b\u4ef6 | 42s | ✓ |
CF 104833N - 桂林精八件
We are given a very small universe of items, exactly eight types of souvenirs. Each type has a limited stock, described by an array of eight integers. Separately, there are $n$ people, and each person independently requests exactly one of these eight types.
CF 104833M - 渚千夏的串
We are asked to construct a binary string consisting only of 0 and 1 such that the number of subsequences equal to 01 is exactly m. A subsequence 01 means we pick a 0 somewhere in the string and a 1 later in the string. Every such pair contributes one to the total count.
CF 104833L - 兀突骨之死
We are simulating a turn-based survival process where a character starts with an initial health value and repeatedly loses health over a sequence of rounds. The twist is that the damage applied at the end of each round is not fixed.
CF 104833K - Devil's Recitation Ⅱ
We are given a triangular grid of depth $n$. The bottom row contains a single cell, and each row above it expands by one cell on both sides, so the top row has $2n-1$ cells.
CF 104833J - Devil's Recitation Ⅰ
We are given a triangular arrangement of cells with $n$ rows. The bottom row has a single cell, and each row above it expands symmetrically so that the top row contains $2n - 1$ cells.
CF 104833I - A = B
We are given many independent checks of a very small “program”: an integer x is stored in a 32-bit signed int, then it is converted into some unknown integer type, and the resulting value is compared against a given integer y.
CF 104833H - Sterling
We are given two strings consisting of lowercase letters. The only allowed operation takes any consecutive block of four characters and deletes its middle two characters, effectively turning a pattern of length four into a pattern of length two while keeping the first and last…
CF 104833G - 舌切雀（Hard Version）
We are given a function applied to every integer from 1 up to a limit $n$, and for each integer we decide whether it contributes a value of 1 or 0. The final answer for each test case is the total number of integers in the range that satisfy a certain structural property.
CF 104833E - 我要打 k 个
We are given a line of elements, each carrying a positive cost equal to its value. We start with a fixed energy budget and want to delete elements from the line as long as we never go negative in energy. Two types of deletions are allowed.
CF 104833D - LR SORT
We are given a process that takes an array and builds a new array by scanning indices from left to right. At each position, the current element is either pushed to the front of a growing result array or appended to its back depending only on whether the position is odd or even.
CF 104833F - 舌切雀（Easy Version）
We are given a function defined on natural numbers. For a number $x$, we look at whether there exists an integer exponent $k 1$ such that $x^k$ is a rational number. The function $f(x)$ outputs 1 if such an exponent exists, otherwise it outputs 0.
CF 104833A - Locked Calculator
We are given a calculator where every button is initially disabled. The buttons include digits from 0 to 9 and the four basic arithmetic operators plus an equals sign. Once we choose some subset of these buttons to activate, we are allowed to use them any number of times.
CF 104833B - おはよう 学弟
We are given a subtraction game played on a pile of balls. A state of the game is defined by the current number of balls, say $a$. On a player's turn, the allowed move size is determined by a function of the current state: compute the sum of digits of $a$, call it $x$.
CF 104833C - おはよう 学妹
We are given two arrays, both of length $n$, and a fixed target number $k$. The task is to count how many pairs of indices $(i, j)$ produce the property that the least common multiple of $ai$ and $bj$ is exactly $k$.