2025 华南师范大学“卓越教育杯”算法与程序设计竞赛（新生赛）

10 problems from 2025 华南师范大学“卓越教育杯”算法与程序设计竞赛（新生赛） (contest 106263), difficulty -. 10/10 solutions verified against sample I/O.

10 items

2025 华南师范大学“卓越教育杯”算法与程序设计竞赛（新生赛）

Special | 10 problems | 10/10 verified | Difficulty - | 9m 12s

# Problem Rating Tags Accepted Time ✓
A gugugaga 58s ✓
B \u5c0f\u6a58\u7684\u9b54\u6cd5\u5b9d\u77f3 52s ✓
C \u56fe\u7247\u538b\u7f29 56s ✓
D Nuit Sans La Soleil 49s ✓
E construction is 2 hard 4 me 58s ✓
F >v< 52s ✓
G \u5c0f\u6a58\u7684\u7cd6\u679c\u6e38\u620f 1m 4s ✓
H SCNU LOGO 1m 3s ✓
I \u5347\u7ea7\u5b9d\u53ef\u68a6 42s ✓
J \u626b\u96ea 58s ✓
Practice › Codeforces Solutions › 2025 华南师范大学“卓越教育杯”算法与程序设计竞赛（新生赛） ›

CF 106263F - >v<

We are interacting with a system that maintains a very short binary string made only of the characters and <. At the start of each game, this hidden string has length at most 8.
codeforces competitive-programming Jun 19, 2026
Practice › Codeforces Solutions › 2025 华南师范大学“卓越教育杯”算法与程序设计竞赛（新生赛） ›

CF 106263I - 升级宝可梦

Each of the six players starts with a level-1 Pokémon. To raise a Pokémon from level $k-1$ to level $k$, we must spend exactly $k-1$ experience crystals. For each player, we are given a target level $ai$.
codeforces competitive-programming Jun 19, 2026
Practice › Codeforces Solutions › 2025 华南师范大学“卓越教育杯”算法与程序设计竞赛（新生赛） ›

CF 106263H - SCNU LOGO

The task starts with a fixed ASCII logo: a small grid made of and . characters with dimensions 5 rows by 36 columns. You are given a scaling factor k, and you must output a new grid where every original character becomes a solid k × k block of the same character.
codeforces competitive-programming Jun 19, 2026
Practice › Codeforces Solutions › 2025 华南师范大学“卓越教育杯”算法与程序设计竞赛（新生赛） ›

CF 106263C - 图片压缩

We are given an image as a grid of pixels, where each pixel has an RGB color. Each color is a point in a 3D integer space with coordinates ranging from 0 to 255.
codeforces competitive-programming Jun 18, 2026
Practice › Codeforces Solutions › 2025 华南师范大学“卓越教育杯”算法与程序设计竞赛（新生赛） ›

CF 106263J - 扫雪

We are given a geometric road network made of straight line segments in the plane. Each segment represents a bidirectional road between two endpoints, but the act of “cleaning” is directional: when the snowplow drives along a segment from one endpoint to the other, it only…
codeforces competitive-programming Jun 18, 2026
Practice › Codeforces Solutions › 2025 华南师范大学“卓越教育杯”算法与程序设计竞赛（新生赛） ›

CF 106263G - 小橘的糖果游戏

We are given a turn-based game played on a single pile of candies. Two players alternate moves, with the first player always moving first. On each move, the current player must remove exactly 1, 3, or 4 candies from the pile.
codeforces competitive-programming Jun 18, 2026
Practice › Codeforces Solutions › 2025 华南师范大学“卓越教育杯”算法与程序设计竞赛（新生赛） ›

CF 106263E - construction is 2 hard 4 me

We are given a strictly increasing sequence of integers. From this sequence, we are allowed to remove at most k elements, leaving a remaining subsequence in the original order.
codeforces competitive-programming Jun 18, 2026
Practice › Codeforces Solutions › 2025 华南师范大学“卓越教育杯”算法与程序设计竞赛（新生赛） ›

CF 106263D - Nuit Sans La Soleil

We are given an infinite grid where we can place tiles shaped like an L. Each tile occupies three unit cells in a 2×2 square minus one corner, so it has four possible orientations depending on how it is rotated.
codeforces competitive-programming Jun 18, 2026
Practice › Codeforces Solutions › 2025 华南师范大学“卓越教育杯”算法与程序设计竞赛（新生赛） ›

CF 106263A - gugugaga

We are given many independent queries. Each query provides two integers $a$ and $b$, and we must compute a value defined through their prime factorizations. The task is to look at all primes that appear in either number.
codeforces competitive-programming Jun 18, 2026
Practice › Codeforces Solutions › 2025 华南师范大学“卓越教育杯”算法与程序设计竞赛（新生赛） ›

CF 106263B - 小橘的魔法宝石

We are given several independent test cases. In each one, we receive a list of integers representing the “magic power” of a collection of stones. For every unordered pair of distinct stones, we compute the bitwise AND of their values and then sum these results over all pairs.
codeforces competitive-programming Jun 18, 2026