2023 Xiangtan University Programming Contest

10 problems from 2023 Xiangtan University Programming Contest (contest 104353), difficulty -. 10/10 solutions verified against sample I/O.

10 items

2023 Xiangtan University Programming Contest

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

#	Problem	Time	✓
A	\u9001\u7ed9\u4e16\u754c\u7684\u793c\u7269	1m 4s	✓
B	\u4e8b\u5173\u75af\u72c2\u661f\u671f\u56db\uff01	53s	✓
C	Markdown\u8868\u683c	1m 1s	✓
D	\u5b64\u5be1\u9752\u86d9	47s	✓
E	\u795e\u4e4b\u771f\u8a00	1m 14s	✓
F	\u7b80\u5355\u5b57\u7b26\u4e32\u95ee\u9898	55s	✓
G	String Game II	47s	✓
H	\u704c\u6c34\u5de5\u7a0b	1m 16s	✓
I	\u66f4\u52a0\u9006\u5929\u7684\u6c42\u548c	59s	✓
J	\u7ebf\u8def\u6539\u5efa	52s	✓

Practice › Codeforces Solutions › 2023 Xiangtan University Programming Contest ›

CF 104353J - 线路改建

The network is a tree rooted at node 1. Each edge represents a bidirectional physical link with a latency value. For any node x, the communication cost f(x) is the sum of edge weights along the unique path from the root to x.

Practice › Codeforces Solutions › 2023 Xiangtan University Programming Contest ›

CF 104353I - 更加逆天的求和

We are given a function defined on an integer $n$. Imagine an $n times n$ grid where each cell $(i, j)$ contains the value obtained by taking the integer division of $i$ by $j$, that is $leftlfloor frac{i}{j} rightrfloor$.

Practice › Codeforces Solutions › 2023 Xiangtan University Programming Contest ›

CF 104353H - 灌水工程

We are counting ways to build exactly $n$ houses under a monotone column structure. Each construction plan can be viewed as a sequence of columns, where the first column has some positive number of houses, and every next column has a positive number of houses that does not…

Practice › Codeforces Solutions › 2023 Xiangtan University Programming Contest ›

CF 104353G - String Game II

Two players, Alice and Bob, start with two strings of equal length. The strings contain only lowercase English letters. They repeatedly perform a game for exactly $P$ rounds.

Practice › Codeforces Solutions › 2023 Xiangtan University Programming Contest ›

CF 104353E - 神之真言

We start with a single seed. First, a fixed cost of $k$ years is spent to plant it, and the plant immediately becomes a tree of height 1. After that, we may apply two types of operations any number of times. The first operation doubles the current height and costs 1 year.

Practice › Codeforces Solutions › 2023 Xiangtan University Programming Contest ›

CF 104353F - 简单字符串问题

We are given a string made of lowercase English letters, and we need to count how many triples of positions $(a, b, c)$ exist such that the indices satisfy $1 le a < b < c le n$, the characters at these positions are all identical, and the indices form an arithmetic…

Practice › Codeforces Solutions › 2023 Xiangtan University Programming Contest ›

CF 104353D - 孤寡青蛙

We are given a small grid of characters representing a decorative picture. Each picture contains several frogs drawn using ASCII art, and the task is to count how many complete frogs appear in the grid.

Practice › Codeforces Solutions › 2023 Xiangtan University Programming Contest ›

CF 104353A - 送给世界的礼物

We are given a target string S and k boxes. Each box i comes with a constraint string Ti. We must split S into exactly k consecutive pieces, allowing empty pieces, such that the i-th piece is a prefix of the remaining suffix of S at step i and also a substring of Ti.

Practice › Codeforces Solutions › 2023 Xiangtan University Programming Contest ›

CF 104353C - Markdown表格

We are given a piece of text written in a simplified Markdown table format. The input consists of a header row, a second row that describes alignment rules for each column, and several data rows.

Practice › Codeforces Solutions › 2023 Xiangtan University Programming Contest ›

CF 104353B - 事关疯狂星期四！

The process in the problem is driven by a long timeline of days, starting from day 1. Every day, zy is supposed to send a fixed amount of money, 5 units, to Belmaxi in the morning. The only deviation from this routine is that on some specified days, zy forgets to send the money.