2024 China Unversity of Geosciences (Wuhan) Freshman Contest

14 problems from 2024 China Unversity of Geosciences (Wuhan) Freshman Contest (contest 105485), difficulty -. 14/14 solutions verified against sample I/O.

14 items

2024 China Unversity of Geosciences (Wuhan) Freshman Contest

Special | 14 problems | 14/14 verified | Difficulty - | 13m 42s

#	Problem	Time	✓
A	\u6570\u7ec4	54s	✓
B	\u501f\u9605\u56fe\u4e66	1m 1s	✓
C	\u6587\u795e\u7684\u5e8f\u5217	1m 6s	✓
D	\u4f4e\u8c37(easy)	56s	✓
E	\u4f24\u5bb3\u6700\u5927\u5316	57s	✓
F	\u732b\u732b\u866b\u56f0\u5883 II	50s	✓
G	\u5965\u8fd0\u4f1a	59s	✓
H	\u6587\u795e\u7684\u6bd4\u8d5b	53s	✓
I	\u667a\u529b\u535a\u5f08	1m 23s	✓
J	\u661f\u7a79\u5217\u8f66	1m 2s	✓
K	\u51b0\u7ea2\u8336	53s	✓
L	\u6570\u7ec4\u4ea4\u6362	1m 1s	✓
M	\u731c\u731c\u770b	52s	✓
N	\u4f4e\u8c37(hard)	55s	✓

Practice › Codeforces Solutions › 2024 China Unversity of Geosciences (Wuhan) Freshman Contest ›

CF 105485M - 猜猜看

We are interacting with a hidden number $x0$, but we never see it directly. Instead, there is a second evolving value $x$ that starts equal to $x0$. We can issue three kinds of interactive commands. One asks whether the current $x$ is divisible by a chosen number $a$.

Practice › Codeforces Solutions › 2024 China Unversity of Geosciences (Wuhan) Freshman Contest ›

CF 105485K - 冰红茶

We are given a rectangular grid with n rows and m columns, and a collection of k bottles of iced tea, each with a fixed price. The task is to place some or all of these bottles into distinct grid cells, with at most one bottle per cell.

Practice › Codeforces Solutions › 2024 China Unversity of Geosciences (Wuhan) Freshman Contest ›

CF 105485J - 星穹列车

The train moves along a fixed horizontal ray that starts at a given point and continues infinitely to the right. Every danger zone is a circle on the plane, and whenever the train’s path passes through a circle, we count only the portion of the train’s path that lies inside…

Practice › Codeforces Solutions › 2024 China Unversity of Geosciences (Wuhan) Freshman Contest ›

CF 105485G - 奥运会

We are asked to count how many Olympic events happen inside a year interval. The key detail is that there are two independent sequences of events: Summer Olympics and Winter Olympics. Each follows a strict periodic pattern.

Practice › Codeforces Solutions › 2024 China Unversity of Geosciences (Wuhan) Freshman Contest ›

CF 105485H - 文神的比赛

We are given a group of contestants in a programming contest. Each contestant has solved a set of problems, and this set is encoded as a string of distinct uppercase letters from A to Z. The length of the string is the number of solved problems.

Practice › Codeforces Solutions › 2024 China Unversity of Geosciences (Wuhan) Freshman Contest ›

CF 105485C - 文神的序列

We are given a sequence of positive integers. In one operation, we pick two different positions i and j, and replace the value at i with the bitwise AND of the two values, ai becomes ai & aj.

Practice › Codeforces Solutions › 2024 China Unversity of Geosciences (Wuhan) Freshman Contest ›

CF 105485D - 低谷(easy)

We are given a sequence of integers representing heights. In one move, we choose any position and decrease that single value by one. We may repeat this operation up to k times.

Practice › Codeforces Solutions › 2024 China Unversity of Geosciences (Wuhan) Freshman Contest ›

CF 105485A - 数组

The task describes an array purely as a way to motivate indexing from zero. If an array has length $n$, its valid indices run from $0$ up to $n - 1$. The problem then asks us to output the index of the last element of such an array when only the length $n$ is given.

Practice › Codeforces Solutions › 2024 China Unversity of Geosciences (Wuhan) Freshman Contest ›

CF 105485N - 低谷(hard)

We are given a sequence of numbers and allowed to perform a fixed number of operations. Each operation chooses a single position and decreases that value by exactly one. After doing this up to k times in total, we want to maximize how many indices become “valleys”.

Practice › Codeforces Solutions › 2024 China Unversity of Geosciences (Wuhan) Freshman Contest ›

CF 105485L - 数组交换

We are given a single array of odd length. The process runs for exactly half of its length rounded down, and each round always removes the first two elements after allowing a single adjacent swap somewhere in the array.

Practice › Codeforces Solutions › 2024 China Unversity of Geosciences (Wuhan) Freshman Contest ›

CF 105485I - 智力博弈

We are given an array that contains each integer from 1 to n exactly twice, but the order is arbitrary. Think of it as a sequence of 2n labeled cards where every label appears exactly two times. Two players then play a game on this sequence.

Practice › Codeforces Solutions › 2024 China Unversity of Geosciences (Wuhan) Freshman Contest ›

CF 105485E - 伤害最大化

We are scheduling actions over a short time horizon of at most 18 steps. At each time step, we must choose exactly one of four skills.

Practice › Codeforces Solutions › 2024 China Unversity of Geosciences (Wuhan) Freshman Contest ›

CF 105485F - 猫猫虫困境 II

We are working on a one-dimensional number line from 1 to n. On this line there are two types of special points: p starting positions for independent agents (called catworms in the statement), and k teleport portals. There is also a single target position g.

Practice › Codeforces Solutions › 2024 China Unversity of Geosciences (Wuhan) Freshman Contest ›

CF 105485B - 借阅图书

We are simulating a library system where books are stored in a stack and readers interact with the system over a sequence of time-stamped events. The books are initially arranged so that book number 1 is at the bottom and book number n is at the top.