2023 Hubei Provincial Collegiate Programming Contest

13 problems from 2023 Hubei Provincial Collegiate Programming Contest (contest 104337), difficulty -. 13/13 solutions verified against sample I/O.

13 items

2023 Hubei Provincial Collegiate Programming Contest

Special | 13 problems | 13/13 verified | Difficulty - | 12m 22s

#	Problem	Time	✓
A	Prime Magic	1m	✓
B	Mode	52s	✓
C	Darkness I	1m 15s	✓
D	Darkness II	1m 12s	✓
E	Inverse Counting Path	46s	✓
F	Inverse Manacher	53s	✓
G	Guess the Polynomial	1m 9s	✓
H	Binary Craziness	53s	✓
I	Step	58s	✓
J	Expansion	49s	✓
K	Dice Game	56s	✓
L	Game	49s	✓
M	Different Billing	50s	✓

Practice › Codeforces Solutions › 2023 Hubei Provincial Collegiate Programming Contest ›

CF 104337M - Different Billing

We are given a contest with a total of $x$ participating teams. Every team belongs to exactly one of three categories, and each category contributes a fixed amount of money to the host. Teams of the first category contribute nothing.

Practice › Codeforces Solutions › 2023 Hubei Provincial Collegiate Programming Contest ›

CF 104337L - Game

We are given a line of points connected by edges. Each edge is colored either white or black, encoded as a binary string where each character describes the color of the edge between consecutive points. So a string of length n represents n+1 points in a row.

Practice › Codeforces Solutions › 2023 Hubei Provincial Collegiate Programming Contest ›

CF 104337K - Dice Game

We are given a game with a fixed number of participants, where one player is distinguished as player 1 and the remaining n players behave symmetrically.

Practice › Codeforces Solutions › 2023 Hubei Provincial Collegiate Programming Contest ›

CF 104337J - Expansion

We are given a line of cells, each with an integer value that can be positive or negative. Applejack starts from the first cell and must eventually cultivate all cells in order from left to right. At the beginning, only cell 1 is cultivated.

Practice › Codeforces Solutions › 2023 Hubei Provincial Collegiate Programming Contest ›

CF 104337I - Step

We are given several circular rings, each with a fixed length. On every ring there is a marker that starts at position 1. Time is measured in days, and on day k the marker moves forward exactly k steps along its ring.

Practice › Codeforces Solutions › 2023 Hubei Provincial Collegiate Programming Contest ›

CF 104337G - Guess the Polynomial

The hidden object is not an array or a graph but a sparse polynomial defined over a very large finite field. Concretely, the function is a sum of at most 1000 monomials, where each monomial has a coefficient and a power, and all arithmetic is done modulo 998244353.

Practice › Codeforces Solutions › 2023 Hubei Provincial Collegiate Programming Contest ›

CF 104337H - Binary Craziness

We are given an undirected graph with $n$ vertices and $m$ edges. The graph may contain self-loops and multiple edges between the same pair of vertices.

Practice › Codeforces Solutions › 2023 Hubei Provincial Collegiate Programming Contest ›

CF 104337F - Inverse Manacher

We are given a hidden string consisting only of the characters a and b. Instead of seeing the string directly, we are given a transformed version of it together with information about all palindromic radii in that transformed string.

Practice › Codeforces Solutions › 2023 Hubei Provincial Collegiate Programming Contest ›

CF 104337D - Darkness II

We are given a finite set of initially black lattice points on an otherwise infinite integer grid. Time evolves in discrete steps. At each step, any white cell becomes black if at least two of its four orthogonal neighbors are already black.

Practice › Codeforces Solutions › 2023 Hubei Provincial Collegiate Programming Contest ›

CF 104337E - Inverse Counting Path

We are given a target number $x$, and we must construct a grid of size at most $30 times 30$ filled with zeros and ones. A cell marked with one is walkable, while zero blocks movement.

Practice › Codeforces Solutions › 2023 Hubei Provincial Collegiate Programming Contest ›

CF 104337C - Darkness I

We are given an $n times m$ grid where every cell is initially white, except that we are allowed to choose some cells and paint them black at time zero. After that, the grid evolves in discrete steps.

Practice › Codeforces Solutions › 2023 Hubei Provincial Collegiate Programming Contest ›

CF 104337A - Prime Magic

We are given several test cases, each consisting of an integer array. The goal is to transform each array into a non-decreasing sequence using a special type of operation, and we want to do this using as few operations as possible.

Practice › Codeforces Solutions › 2023 Hubei Provincial Collegiate Programming Contest ›

CF 104337B - Mode

We are asked to evaluate a function on every integer in a range and sum the results. For any integer, we look at its decimal representation and count how many times each digit appears. The function value is the largest frequency among all digits.