2025 Winter China Unversity of Geosciences (Wuhan) Freshman Contest
13 problems from 2025 Winter China Unversity of Geosciences (Wuhan) Freshman Contest (contest 106194), difficulty -. 13/13 solutions verified against sample I/O.
2025 Winter China Unversity of Geosciences (Wuhan) Freshman Contest
Special | 13 problems | 13/13 verified | Difficulty - | 12m 49s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | A + B Problem | 55s | ✓ | |||
| B | \u5171\u9e23\u62a4\u7b26 | 48s | ✓ | |||
| C | \u4e03\u5343\u56db\u767e\u53f7\u7684\u56de\u54cd | 1m 12s | ✓ | |||
| D | \u5bfb\u627e\u54c8\u57fa\u7c73 | 52s | ✓ | |||
| E | \u4e0d\u754f\u82e6\u6697 | 1m 2s | ✓ | |||
| F | \u90b5\u63a5\u5f85\u4e4b\u6218 | 1m 19s | ✓ | |||
| G | \u732b\u732b\u866b\u56f0\u5883III | 54s | ✓ | |||
| H | \u9b54\u5973\u4e4b\u65c5 | 1m 11s | ✓ | |||
| I | \u9694\u5899\u82b1\u5f71\u65e7\u76f8\u77e5 | 42s | ✓ | |||
| J | \u4f0a\u6ce2\u6069\u00b7\u5f17\u5854\u6839\u7684\u6284\u672c | 1m 10s | ✓ | |||
| K | \u9ec4\u91d1\u9b54\u5973\u7684\u8c1c\u9898 | 1m 2s | ✓ | |||
| L | Ep13.\u6ca1\u6709\u7231\u5c31\u770b\u4e0d\u89c1 | 49s | ✓ | |||
| M | \u5982\u679c\u662f\u52c7\u8005\u8f9b\u7f8e\u5c14\u7684\u8bdd | 53s | ✓ |
CF 106194K - 黄金魔女的谜题
We are given a rooted tree with node 1 fixed as the root. Two players start on two different nodes, Alice on node A and Bob on node B. They move alternately, with Alice starting first.
CF 106194I - 隔墙花影旧相知
We are given a single integer $m$ up to $10^{12}$. From this number, we consider all its positive divisors and sort them in increasing order.
CF 106194B - 共鸣护符
We are given a closed interval of integers from L to R, and we must arrange all these integers into a permutation so that the ordering between any pair of numbers depends entirely on whether they are coprime.
CF 106194G - 猫猫虫困境III
We are working on an integer grid where each entity moves in discrete time under two competing forces: player-controlled movement and a deterministic attraction toward the origin.
CF 106194M - 如果是勇者辛美尔的话
We are given points placed on a circle, each point having an angle θ and an independent probability p of being “activated”. After activation, every triple of activated points forms a triangle, and all such triangles together act as a defensive region.
CF 106194D - 寻找哈基米
The grid describes a city map where each cell is either free ground, an obstacle building, a street tile, or one of two special positions: the starting point and the target.
CF 106194L - Ep13.没有爱就看不见
This problem removes all typical algorithmic structure and reduces the task to a fixed output decision. There is no input stream, no parameters, and no hidden state.
CF 106194J - 伊波恩·弗塔根的抄本
We are given a bipartite system between two cities. One side has $n$ entities and the other has $m$. Some pairs between the two sides are already connected by “links”.
CF 106194H - 魔女之旅
We are given a sequence of integers representing friendliness values of towns arranged in a line. A traveler must choose a contiguous segment of this sequence, but the segment length is restricted: it must contain at least L towns and at most R towns.
CF 106194F - 邵接待之战
Two players engage in a turn-based simulation where each maintains two resources and a queue of actions. Each action is either an attack, a defence, or a hide move, and every action carries a numeric strength.
CF 106194E - 不畏苦暗
Each light source is placed on an integer line at position $xi$, and each source has a strength $vi$. A source does not illuminate everything uniformly.
CF 106194C - 七千四百号的回响
We are given a sequence of values that represents measurements stored in a system. These values have been corrupted by a series of operations. Each operation selects a continuous segment of the array and flips the sign of every value in that segment.
CF 106194A - A + B Problem
We are given two very large integers, each representing a number written on a separate record card. The task is not to compute the full sum in its entirety, but only to determine the last digit of their sum.