The 10th Jimei University Programming Contest

12 problems from The 10th Jimei University Programming Contest (contest 104741), difficulty -. 12/12 solutions verified against sample I/O.

12 items

The 10th Jimei University Programming Contest

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

# Problem Rating Tags Accepted Time ✓
A A+B\u95ee\u9898 51s ✓
B \u5c0fM\u7684\u6e38\u620f 52s ✓
C \u65b9\u683c\u67d3\u8272 50s ✓
D \u5212\u5206\u5e73\u9762 42s ✓
E \u65f6\u95f4\u8d85\u9650\u03b1 1m 1s ✓
F \u65f6\u95f4\u8d85\u9650\u03b2 1m 8s ✓
G \u6211\u8981\u6210\u4e3a\u5b9d\u53ef\u68a6\u5927\u5e08\uff01 52s ✓
H \u73bb\u7483\u7403 1m 26s ✓
I \u671f\u4e2d\u8003\u8bd5 51s ✓
J \u8fdb\u5236\u8f6c\u6362 57s ✓
K \u65b9\u683c\u586b\u6570 50s ✓
L \u5144\u5f1f\u6821\u95ee\u9898 52s ✓
Practice › Codeforces Solutions › The 10th Jimei University Programming Contest ›

CF 104741B - 小M的游戏

We are given a weighted undirected graph with $N$ locations and $M$ roads. Two players start at node $1$ and want to reach node $N$.
codeforces competitive-programming Jun 29, 2026
Practice › Codeforces Solutions › The 10th Jimei University Programming Contest ›

CF 104741L - 兄弟校问题

We are given a collection of schools. Each school has a name and a city. We also have a list of keyword strings. A school is considered directly related to a keyword if that keyword appears as a whole token inside the school name, where tokens are the parts separated by…
codeforces competitive-programming Jun 29, 2026
Practice › Codeforces Solutions › The 10th Jimei University Programming Contest ›

CF 104741C - 方格染色

We are given a grid shaped like two rows and n columns, so there are 2n cells arranged in a rectangle. Each cell must be colored either black or white.
codeforces competitive-programming Jun 29, 2026
Practice › Codeforces Solutions › The 10th Jimei University Programming Contest ›

CF 104741K - 方格填数

We are working with an $n times m$ grid, and each cell can be assigned a value from $1$ to $k$. After a full assignment, we look at each cell and decide whether it is “locally maximal” in a very specific sense: a cell is considered special if its value is strictly greater…
codeforces competitive-programming Jun 28, 2026
Practice › Codeforces Solutions › The 10th Jimei University Programming Contest ›

CF 104741J - 进制转换

Each test gives a target value and a list of weighted positions indexed from 0 to m. At position i, we have a coefficient ci, and a fixed weight determined by powers of two parameters a and b. We are allowed to pick a subset of indices s0 < s1 < ...
codeforces competitive-programming Jun 28, 2026
Practice › Codeforces Solutions › The 10th Jimei University Programming Contest ›

CF 104741H - 玻璃球

We are given a rooted tree of size $N$, rooted at node 1. Each node represents a platform, and each platform initially contains exactly one glass ball.
codeforces competitive-programming Jun 28, 2026
Practice › Codeforces Solutions › The 10th Jimei University Programming Contest ›

CF 104741I - 期中考试

We are working with a repeating weekly calendar where each day is identified by a week index and a weekday index from 1 to 7. Time moves forward one day at a time, and after day 7 of a week, the next week begins.
codeforces competitive-programming Jun 28, 2026
Practice › Codeforces Solutions › The 10th Jimei University Programming Contest ›

CF 104741G - 我要成为宝可梦大师！

We are simulating a deterministic Pokémon-style duel between two single Pokémon, except that the outcome of each attack depends on probabilistic damage ranges and type interactions. Each Pokémon has six base stats and up to two elemental types.
codeforces competitive-programming Jun 28, 2026
Practice › Codeforces Solutions › The 10th Jimei University Programming Contest ›

CF 104741F - 时间超限β

We are given several independent evaluation machines. Each machine has a limited number of threads, and using more threads changes the runtime behavior in a non-trivial way. For the i-th machine, there are $ki$ available threads.
codeforces competitive-programming Jun 28, 2026
Practice › Codeforces Solutions › The 10th Jimei University Programming Contest ›

CF 104741E - 时间超限α

Each evaluation server can process submissions in parallel using multiple threads, but the efficiency of each thread depends on how many threads are active on that server.
codeforces competitive-programming Jun 28, 2026
Practice › Codeforces Solutions › The 10th Jimei University Programming Contest ›

CF 104741D - 划分平面

We are given a set of N distinct points in the plane, each representing a village. We want to choose a straight line that passes through exactly two of these villages. This line is used as a border between two regions.
codeforces competitive-programming Jun 28, 2026
Practice › Codeforces Solutions › The 10th Jimei University Programming Contest ›

CF 104741A - A+B问题

We are given multiple independent queries. Each query contains three numbers written in the same unknown positional numeral system with base $X$, where $X$ is some integer between 2 and 16 inclusive.
codeforces competitive-programming Jun 28, 2026