Words Learing form Tasks
ABC436
A. o-padding
- pad v. 覆盖
o-padding
- obtain v. 得到,获得
Print the string obtained by repeatedly adding the lowercase English letter o to the beginning of S until its length becomes N.
- inclusive adj. 包含的,包括的
S is a string consisting of lowercase English letters with length between 1 and N−1, inclusive.
B. Magic Square
- grid n.网格
There is a grid with N rows and N columns, where all cells are initially empty. Now, you will write integers in each cell of this grid according to the following procedure.
D. Teleport Maze
- maze n. 曲径,迷宫
D - Teleport Maze
- warp v.弯曲
Lowercase English letter (a - z): Warp cell(根据上下文是传送门的意思,但是为什么用 warp?)
F. Starry Landscape Photo
- starry adj. 满天星斗的
F - Starry Landscape Photo
G. Linear Inequation
- linear adj. 线的,线性的
G. Linear Inequation
ABC438
B. Tombola
- tombola v. 摸彩
B. Tombola
C. Reindeer and Sleigh 2
- reindeer n. 驯鹿
- sleigh n. 雪橇
C - Reindeer and Sleigh 2
- sled n. 雪橇
There are N reindeer and one sled
E. Sort Arrays
- lexicographical n. 字典的
- indices (index 的复数) n. 指标,索引
In other words, when \(A_1,A_2,…,A_N\) are arranged in lexicographical order (when there are multiple equal sequences, arrange those with smaller indices first), P is the sequence of indices that appears in that arrangement.
F. Manhattan Christmas Tree 2
- Manhattan 曼哈顿
F - Manhattan Christmas Tree 2
- coordinates n. 坐标
Change the coordinates of the i-th Christmas tree to (x,y).
CF2189
B. The Curse of the Frog
- curse n. 诅咒
B. The Curse of the Frog
- meditation n. 冥想
After many years of meditation
- constraints n. 约束
It can be proven that under the constraints of the problem
ICPC2025沈阳站
- lattice n. 格子
each initially located at an integer lattice point in the Cartesian
plane
ABC448
B. Pepper Addiction
- compatibility n. 兼容性
- sprinkle v. 撒,洒
Due to compatibility, only type \(A_i\) pepper can be sprinkled on dish \(i\)
C. Except and Min
- perform v. 执行
You should perform the following sequence of operations
- afterwards adv. 之后
Afterwards, return all K removed balls to the bag.
D. Integer-duplicated Path
- duplicated adj. 复写出的 v. 重复
Integer-duplicated Path
E. Simple Division
- remainder n. 剩余物、余数
Find the remainder when \(\lfloor \frac N M\rfloor\) is divided by 10007
- denote v. 表示
Here, \(\lfloor x\rfloor\) denotes the largest integer not exceeding x
- recover v. 恢复、找回
- procedure n. 程序、手续、步骤
To recover the original N, use the following procedure.
F. Authentic Traveling Salesman Problem
- authentic v.真实的
Authentic Traveling Salesman Problem
- coordinates n. 坐标
Location \(i\) is at coordinates \((X_i,Y_i)\)
- constraints n. 约束
It is guaranteed that at least one such route exists under the given constraints.
G. Conquest
- simultaneously adv. 同时地
These two ban operations are performed simultaneously.
本文来自博客园,作者:ricky_lin,转载请注明原文链接:https://www.cnblogs.com/rickylin/p/19405827

浙公网安备 33010602011771号