2023年中国大学生程序设计竞赛女生专场

12 problems from 2023年中国大学生程序设计竞赛女生专场 (contest 104725), difficulty -. 12/12 solutions verified against sample I/O.

12 items

2023年中国大学生程序设计竞赛女生专场

Special | 12 problems | 12/12 verified | Difficulty - | 11m 57s

# Problem Rating Tags Accepted Time ✓
A \u75be\u7fbd\u7684\u6551\u8d4e 51s ✓
B \u7ec8\u7109\u4e4b\u8327 1m 6s ✓
C \u56fd\u738b\u7684\u7591\u60d1 56s ✓
D \u91d1\u4eba\u65e7\u5df7\u5e02\u5edb\u55a7 1m 4s ✓
E \u6c38\u4e16\u4e50\u571f 1m 15s ✓
F \u6700\u957f\u4e0a\u5347\u5b50\u5e8f\u5217 1m 6s ✓
G \u7cbe\u7075\u5b9d\u53ef\u68a6\u5bf9\u6218 55s ✓
H \u5b57\u7b26\u4e32\u6e38\u620f 56s ✓
I \u5e78\u798f\u524d\u65b9\u7684\u7269\u8bed 1m 5s ✓
J \u5723\u591c\u7684\u5947\u8ff9\u8dd1\u8005 57s ✓
K RSP 53s ✓
L \u517b\u6210\u6e38\u620f 53s ✓
Practice › Codeforces Solutions › 2023年中国大学生程序设计竞赛女生专场 ›

CF 104725B - 终焉之茧

We are playing an interactive search game on a 2D integer grid. There is a hidden target point with integer coordinates bounded inside a square around the origin, and we start from the origin.
codeforces competitive-programming Jun 29, 2026
Practice › Codeforces Solutions › 2023年中国大学生程序设计竞赛女生专场 ›

CF 104725G - 精灵宝可梦对战

We are simulating a turn-based duel between two ordered teams of Pokémon-like fighters. Each team is a queue of units, and at any moment only the front unit of each team is active. The two players alternate turns, starting with Alice.
codeforces competitive-programming Jun 29, 2026
Practice › Codeforces Solutions › 2023年中国大学生程序设计竞赛女生专场 ›

CF 104725K - RSP

We are given a two-player game that generalizes rock-paper-scissors to $n$ symbols arranged in a cycle. Symbol $i$ defeats symbol $i+1$, and symbol $n$ defeats symbol $1$. Any other pairing that is not a direct win relation results in a draw.
codeforces competitive-programming Jun 29, 2026
Practice › Codeforces Solutions › 2023年中国大学生程序设计竞赛女生专场 ›

CF 104725L - 养成游戏

We are given a small system of integer variables. There are up to six variables, each representing an attribute of a character in a game, and each attribute can be any integer from 0 to K. Alongside these variables, there are up to 100 judges.
codeforces competitive-programming Jun 29, 2026
Practice › Codeforces Solutions › 2023年中国大学生程序设计竞赛女生专场 ›

CF 104725I - 幸福前方的物语

We are given an interval of integers from $l$ to $r$. From this interval we consider all subsets, including the empty subset. For any subset, we multiply all chosen numbers and check whether the product is a perfect square.
codeforces competitive-programming Jun 29, 2026
Practice › Codeforces Solutions › 2023年中国大学生程序设计竞赛女生专场 ›

CF 104725J - 圣夜的奇迹跑者

We are given a one-dimensional race track represented by integer positions from 1 to m. A special “perfect zone” is the suffix interval [R, m], and the final goal is to maximize the chance that a specific skill is the k-th skill to successfully trigger inside this perfect…
codeforces competitive-programming Jun 29, 2026
Practice › Codeforces Solutions › 2023年中国大学生程序设计竞赛女生专场 ›

CF 104725H - 字符串游戏

We are given a collection of strings owned by one player, and a second collection of strings used to generate queries. For each query string, we consider every one of its substrings as a separate game instance.
codeforces competitive-programming Jun 29, 2026
Practice › Codeforces Solutions › 2023年中国大学生程序设计竞赛女生专场 ›

CF 104725F - 最长上升子序列

We are given an array over positions, where each position i comes with a number a[i]. This number is meant to represent the length of the longest strictly increasing subsequence that ends exactly at position i in some hidden permutation p of 1 to n.
codeforces competitive-programming Jun 29, 2026
Practice › Codeforces Solutions › 2023年中国大学生程序设计竞赛女生专场 ›

CF 104725E - 永世乐土

We are given an undirected graph with up to 30 nodes and 50 edges. Several special nodes are marked as “memory locations”, and each of these contains one or more memories of interest. We start at node 1 and can walk along edges step by step.
codeforces competitive-programming Jun 29, 2026
Practice › Codeforces Solutions › 2023年中国大学生程序设计竞赛女生专场 ›

CF 104725D - 金人旧巷市廛喧

The grid describes a city map where movement is only allowed through passable cells and only in four directions. Some cells are blocked, some cells provide a bonus, and all other cells are neutral. There are exactly $k$ starting positions and $k$ ending positions.
codeforces competitive-programming Jun 29, 2026
Practice › Codeforces Solutions › 2023年中国大学生程序设计竞赛女生专场 ›

CF 104725C - 国王的疑惑

We are given a large directed complete graph structure that is not meant to be processed explicitly. The full graph consists of $K$ identical blocks, each block containing $n$ cities.
codeforces competitive-programming Jun 29, 2026
Practice › Codeforces Solutions › 2023年中国大学生程序设计竞赛女生专场 ›

CF 104725A - 疾羽的救赎

We are simulating a small board game played on a linear track of nine cells. Initially, there are three distinct pieces placed on fixed positions: a purple piece starts at cell 2, a green piece at cell 3, and a yellow piece at cell 4.
codeforces competitive-programming Jun 29, 2026