Dalian University of Technology, Software College 2025 Freshman Contest
11 problems from Dalian University of Technology, Software College 2025 Freshman Contest (contest 106486), difficulty -. 11/11 solutions verified against sample I/O.
Dalian University of Technology, Software College 2025 Freshman Contest
Special | 11 problems | 11/11 verified | Difficulty - | 10m 13s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | \u96c6\u5408\u6808\u8ba1\u7b97\u673a II | 1m | ✓ | |||
| B | \u673a\u68b0\u732b\u7684\u6d41\u6d6a | 1m 18s | ✓ | |||
| C | \u8ddf\u6211\u7684\u6f2b\u6e38\u8005\u8bf4\u53bb\u5427 | 49s | ✓ | |||
| D | \u65e0\u4eba\u80fd\u8bc1\u7684\u731c\u60f3 | 42s | ✓ | |||
| E | Excel \u7684\u5217\u7f16\u53f7 | 43s | ✓ | |||
| F | \u9001\u718f\u8089 | 48s | ✓ | |||
| G | \u8fdc\u4ea4\u8fd1\u653b | 1m 2s | ✓ | |||
| H | Silly Tree | 1m 15s | ✓ | |||
| I | \u5976\u9f99\u5854 | 48s | ✓ | |||
| J | \u5c0f\u732b\u9493\u9c7c | 1m 6s | ✓ | |||
| L | \u7528\u6237\u540d\u957f\u5ea6\u5e94\u5728 5 \u4f4d\u5230 12 \u4f4d\u4e4b\u95f4 | 42s | ✓ |
CF 106486F - 送熏肉
We are given a long sequence of levels, each level carrying a difficulty value. The player can remove exactly one contiguous block of fixed length $k$, and everything outside that block remains and contributes to the total difficulty.
CF 106486I - 奶龙塔
We are given a collection of blocks, each block having a positive integer size. We want to stack all of them into a single vertical tower. The only rule is that a block can be placed on top of another block only if its size is strictly smaller than the block below it.
CF 106486D - 无人能证的猜想
We start from a positive integer $x$. At each step, we apply the classic Collatz transformation. If the current value is odd, it becomes $3x+1$. If the current value is even, it becomes $x/2$. The task is not to simulate forever.
CF 106486J - 小猫钓鱼
We are simulating a sequential card game where players repeatedly draw cards from a fixed deck and place them into a growing line of cards called the pond. The players act in a fixed cycle: player 1, then 2, up to n, and then repeating.
CF 106486A - 集合栈计算机 II
We are given a target integer $x$, and we must construct a sequence of stack operations that builds exactly one final set $T$ such that a recursively defined “size” function $f(T)$ equals $x$. The system manipulates sets of sets starting from the empty set.
CF 106486L - 用户名长度应在 5 位到 12 位之间
The task is centered around validating a username based purely on its length. We are given a single identifier, and the only requirement is to check whether its length falls within a fixed inclusive range.
CF 106486H - Silly Tree
We are asked to count rooted ordered trees on exactly $n$ nodes under a structural constraint on branching. Each node has some number of children, and this number must belong to a given allowed set $A$.
CF 106486G - 远交近攻
We are given a line of positions from 1 to n, each position holding some initial amount of resources. Initially every position is its own independent group, so there are n disjoint groups, each containing exactly one index.
CF 106486E - Excel 的列编号
We are given a sequence of queries, each query is a large positive integer representing a column index in a spreadsheet system that labels columns using letters instead of numbers.
CF 106486B - 机械猫的流浪
We are given a robot cat moving along a straight path of positions from 1 to $n+1$. It starts at position 1 at time 0 and wants to reach position $n+1$. Each move to the next position consumes exactly one unit of time. Energy is the critical constraint.
CF 106486C - 跟我的漫游者说去吧
We are looking at a game mechanic where the probability of landing a critical hit is not fixed, but depends on how long it has been since the previous critical hit. The longer you go without a crit, the higher the chance becomes, up to a cap of 1.