The 17-th BIT Campus Programming Contest - Onsite Round

13 problems from The 17-th BIT Campus Programming Contest - Onsite Round (contest 104825), difficulty -. 13/13 solutions verified against sample I/O.

13 items

The 17-th BIT Campus Programming Contest - Onsite Round

Special | 13 problems | 13/13 verified | Difficulty - | 11m 54s

#	Problem	Time	✓
A	\u8d5b\u524d\u987b\u77e5	45s	✓
B	\u5c0fL\u7684\u56f4\u68cb	58s	✓
C	\u5c0fL\u7684\u65c5\u884c	52s	✓
D	\u5c0fL\u7684\u6570\u5b66\u9898	52s	✓
E	MyGO!!!!!	1m 6s	✓
F	Harmini	1m 9s	✓
G	War	48s	✓
H	LCA Determinant	55s	✓
I	\u661f\u5149\u6307\u5f15\u524d\u8def	1m	✓
J	pass	1m 2s	✓
K	str\u8fdb\u5236	45s	✓
L	Equation	42s	✓
M	\u5c0fH\u7684\u7cd6\u679c	1m	✓

Practice › Codeforces Solutions › The 17-th BIT Campus Programming Contest - Onsite Round ›

CF 104825M - 小H的糖果

We are given a row of candy, each candy labeled with a lowercase letter. From this row we will pick a starting position, and then eat that candy and everything to its right, producing a suffix string.

Practice › Codeforces Solutions › The 17-th BIT Campus Programming Contest - Onsite Round ›

CF 104825L - Equation

We are asked to find all integers $x$ in the range $0 le x < M$ such that a self-referential modular equation holds: the value $x^x$ and the value $x$ are congruent modulo $M$.

Practice › Codeforces Solutions › The 17-th BIT Campus Programming Contest - Onsite Round ›

CF 104825K - str进制

We are given a string that acts like a description of a positional numeral system, except it is not a fixed base like decimal or binary. Instead, each position has its own “carry rule”.

Practice › Codeforces Solutions › The 17-th BIT Campus Programming Contest - Onsite Round ›

CF 104825J - pass

We are given a very simplified model of a road that consists of a flat horizontal segment, followed immediately by a vertical wall, and then a horizontal top surface of that wall. A car tries to pass through this structure.

Practice › Codeforces Solutions › The 17-th BIT Campus Programming Contest - Onsite Round ›

CF 104825I - 星光指引前路

We are given a set of axis-aligned rectangles on a plane. Each rectangle has a weight. Then we are given several query points. For each query point, we look at all rectangles that contain that point and extract their weights.

Practice › Codeforces Solutions › The 17-th BIT Campus Programming Contest - Onsite Round ›

CF 104825H - LCA Determinant

We are given a rooted tree with vertices numbered from 1 to n, with vertex 1 acting as the root. Each vertex u carries a value a[u].

Practice › Codeforces Solutions › The 17-th BIT Campus Programming Contest - Onsite Round ›

CF 104825G - War

We are given a grid where each cell is either empty or contains a single enemy unit. Empty cells and the area outside the grid are already controlled by us. The grid starts with all enemy cells still alive, and the goal is to eliminate every enemy cell.

Practice › Codeforces Solutions › The 17-th BIT Campus Programming Contest - Onsite Round ›

CF 104825F - Harmini

We are given a tree with $n$ nodes, and each edge has an unknown integer weight. The tree structure is known in advance, but the weights are hidden.

Practice › Codeforces Solutions › The 17-th BIT Campus Programming Contest - Onsite Round ›

CF 104825E - MyGO!!!!!

We are given a sequence of integers and we want to cut it into contiguous non-empty segments. Every segment must satisfy a constraint on its bitwise XOR: the XOR of all elements inside the segment must be strictly greater than a given threshold $k$.

Practice › Codeforces Solutions › The 17-th BIT Campus Programming Contest - Onsite Round ›

CF 104825D - 小L的数学题

We are given a positive integer $n le 10^{12}$. For every integer $i$ from 1 to $n$, we define a value $f(i)$ based on the divisors of $i$. A divisor $d mid i$ is called valid if the complementary divisor $i/d$ shares no common prime factor with $d$.

Practice › Codeforces Solutions › The 17-th BIT Campus Programming Contest - Onsite Round ›

CF 104825B - 小L的围棋

We are given a one-dimensional array a of length n. Each value of this array defines weights over all intervals in a very specific way: every pair of indices (x, y) with x ≤ y corresponds to a grid point on a triangular board, and that point implicitly carries a value…

Practice › Codeforces Solutions › The 17-th BIT Campus Programming Contest - Onsite Round ›

CF 104825C - 小L的旅行

We are given a directed graph of n locations and m one-way roads. Traveling along any road costs exactly one minute.

Practice › Codeforces Solutions › The 17-th BIT Campus Programming Contest - Onsite Round ›

CF 104825A - 赛前须知

The task is intentionally trivial from a computational perspective. We are given a multiple-choice exam consisting of 10 independent questions. Each question has four options labeled A to D, and the correct output is simply a sequence of chosen options, one per line.