2024年“核桃杯”武汉地区ACM萌新赛

14 problems from 2024年“核桃杯”武汉地区ACM萌新赛 (contest 105434), difficulty -. 14/14 solutions verified against sample I/O.

14 items

2024年“核桃杯”武汉地区ACM萌新赛

Special | 14 problems | 14/14 verified | Difficulty - | 15m 31s

# Problem Rating Tags Accepted Time ✓
A \u4f60\u597d\uff0cHWCWHer 53s ✓
B \u5168\u6982\u7387\u516c\u5f0f 56s ✓
C LCT 1m 3s ✓
D \u80a1\u7968\u4ea4\u6613 54s ✓
E HoMaCoMoHa! 1m 17s ✓
F Starlight 1m 23s ✓
G Mobiusp\u7684\u5e0c\u671b\u6811 1m 5s ✓
H \u7236\u5b50\u5c40 57s ✓
I \u8f6e\u7b26\u96e8 1m 9s ✓
J \u70ab\u8000\u5feb\u4e50 1m 19s ✓
K agKc \u4e0e\u592a\u9633\u7529\u5728\u8eab\u540e 1m 16s ✓
L \u65b0\u751f\u8d5b\u4e0e\u90aa\u6076\u8ba1\u5212 56s ✓
M \u6218\u4e89\u6e38\u620f II 1m 23s ✓
N \u865a\u62df\u6362\u4e58 1m ✓
Practice › Codeforces Solutions › 2024年“核桃杯”武汉地区ACM萌新赛 ›

CF 105434M - 战争游戏 II

We are given a tree where a defender starts at a fixed node and an attacker repeatedly chooses a node to “bomb” over several rounds.
codeforces competitive-programming Jun 23, 2026
Practice › Codeforces Solutions › 2024年“核桃杯”武汉地区ACM萌新赛 ›

CF 105434N - 虚拟换乘

We are given a transport system that is essentially a single directed chain of stations from 0 to n − 1. Between station i − 1 and i, there is exactly one road segment with a fixed length, and that segment allows only certain transport modes chosen from a subset of K total…
codeforces competitive-programming Jun 23, 2026
Practice › Codeforces Solutions › 2024年“核桃杯”武汉地区ACM萌新赛 ›

CF 105434L - 新生赛与邪恶计划

We have a classroom with seats labeled from 1 to n, and initially each seat is meant for the student with the same number. The final student of interest is student n, who is guaranteed to be a newcomer.
codeforces competitive-programming Jun 23, 2026
Practice › Codeforces Solutions › 2024年“核桃杯”武汉地区ACM萌新赛 ›

CF 105434K - agKc 与太阳甩在身后

The grid is an $N times M$ board where every cell initially contains crystals except one special empty cell at $(X, Y)$. From that single empty starting point, we are allowed to place a device only on currently empty cells.
codeforces competitive-programming Jun 23, 2026
Practice › Codeforces Solutions › 2024年“核桃杯”武汉地区ACM萌新赛 ›

CF 105434J - 炫耀快乐

We are given a line of students. Each student holds one “lucky number” between 1 and m, so the line can be seen as an array S of length n over m categories. We are allowed to assign a ranking to these m lucky numbers by choosing a permutation of 1 through m.
codeforces competitive-programming Jun 23, 2026
Practice › Codeforces Solutions › 2024年“核桃杯”武汉地区ACM萌新赛 ›

CF 105434I - 轮符雨

We are given several independent test cases. In each one, there is a sequence representing rain intensity over consecutive days. Starting from zero, Soyo’s “anticipation value” changes every day based on how much the rain intensity changes compared to the previous day.
codeforces competitive-programming Jun 23, 2026
Practice › Codeforces Solutions › 2024年“核桃杯”武汉地区ACM萌新赛 ›

CF 105434H - 父子局

Each test case gives a single integer $n$. The task is to split this number into two different positive integers $x$ and $y$ such that their sum equals $n$. If such a pair cannot exist, the output must be two negative ones.
codeforces competitive-programming Jun 23, 2026
Practice › Codeforces Solutions › 2024年“核桃杯”武汉地区ACM萌新赛 ›

CF 105434G - Mobiusp的希望树

We are asked to construct a rooted tree on the vertices labeled from 1 to n, where 1 is fixed as the root. The structure of the tree is heavily constrained: every edge must go from a smaller label to a larger label, so labels strictly increase along any path from the root.
codeforces competitive-programming Jun 23, 2026
Practice › Codeforces Solutions › 2024年“核桃杯”武汉地区ACM萌新赛 ›

CF 105434F - Starlight

We are given a permutation that represents stones placed in a line. Each day, the process removes the leftmost remaining stone from the ground and places it on top of a growing stack (a tower).
codeforces competitive-programming Jun 23, 2026
Practice › Codeforces Solutions › 2024年“核桃杯”武汉地区ACM萌新赛 ›

CF 105434E - HoMaCoMoHa!

We start with a pile of identical level-1 entities. The system repeatedly allows a move whenever two entities share the same level i, provided i is not the maximum level k.
codeforces competitive-programming Jun 23, 2026
Practice › Codeforces Solutions › 2024年“核桃杯”武汉地区ACM萌新赛 ›

CF 105434D - 股票交易

We are given a sequence of daily stock prices. You are allowed to pick at most one pair of days, buy on an earlier day and sell on a later day, and you earn profit equal to the increase in price divided by the number of days held.
codeforces competitive-programming Jun 23, 2026
Practice › Codeforces Solutions › 2024年“核桃杯”武汉地区ACM萌新赛 ›

CF 105434C - LCT

We are given a rooted tree where node 1 is the root, and each edge has an index according to its input order. Every edge starts in an active state, meaning all nodes are initially fully connected. Each operation consists of two actions.
codeforces competitive-programming Jun 23, 2026
Practice › Codeforces Solutions › 2024年“核桃杯”武汉地区ACM萌新赛 ›

CF 105434B - 全概率公式

We are given several independent data sources, each representing a platform that might contribute to a mixed dataset. Each platform contributes a known fraction of the total data, and each platform also has its own probability of being “AI contaminated”.
codeforces competitive-programming Jun 23, 2026
Practice › Codeforces Solutions › 2024年“核桃杯”武汉地区ACM萌新赛 ›

CF 105434A - 你好，HWCWHer

The task describes five universities and asks us to “choose” one of them, then output its English abbreviation as a single uppercase string. There is no input, so the program does not receive any data to guide the choice at runtime.
codeforces competitive-programming Jun 23, 2026