The 2023 Guangdong Provincial Collegiate Programming Contest

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

13 items

The 2023 Guangdong Provincial Collegiate Programming Contest

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

# Problem Rating Tags Accepted Time ✓
A Programming Contest 48s ✓
B Base Station Construction 1m 2s ✓
C Trading 1m 3s ✓
D New Houses 55s ✓
E New but Nostalgic Problem 53s ✓
F Traveling in Cells 59s ✓
G Swapping Operation 54s ✓
H Canvas 55s ✓
I Path Planning 53s ✓
J X Equals Y 1m 11s ✓
K Peg Solitaire 56s ✓
L Classic Problem 55s ✓
M Computational Geometry 58s ✓
Practice › Codeforces Solutions › The 2023 Guangdong Provincial Collegiate Programming Contest ›

CF 104369M - Computational Geometry

We are given a convex polygon described by its vertices in counterclockwise order. The task is to choose two distinct vertices and draw a chord between them, but not every pair is allowed: the chord must actually split the polygon into two regions, and both resulting pieces…
codeforces competitive-programming Jul 1, 2026
Practice › Codeforces Solutions › The 2023 Guangdong Provincial Collegiate Programming Contest ›

CF 104369L - Classic Problem

We are given a very large graph on vertices labeled from 1 to n, where every pair of vertices is connected by an edge, so the graph is complete.
codeforces competitive-programming Jul 1, 2026
Practice › Codeforces Solutions › The 2023 Guangdong Provincial Collegiate Programming Contest ›

CF 104369J - X Equals Y

We are asked to choose two bases, one for $x$ and one for $y$, so that when both numbers are written in their respective bases, the resulting digit sequences are identical when read from least significant digit to most significant digit.
codeforces competitive-programming Jul 1, 2026
Practice › Codeforces Solutions › The 2023 Guangdong Provincial Collegiate Programming Contest ›

CF 104369K - Peg Solitaire

We are given a very small chessboard, at most six rows by six columns, with up to six pegs placed on distinct cells.
codeforces competitive-programming Jul 1, 2026
Practice › Codeforces Solutions › The 2023 Guangdong Provincial Collegiate Programming Contest ›

CF 104369I - Path Planning

We are given a grid where every cell contains a distinct integer from the range $[0, n cdot m - 1]$. We start at the top-left cell and can only move right or down until reaching the bottom-right cell.
codeforces competitive-programming Jul 1, 2026
Practice › Codeforces Solutions › The 2023 Guangdong Provincial Collegiate Programming Contest ›

CF 104369H - Canvas

We are given a sequence of length $n$, initially filled with zeros. We also have $m$ operations. Each operation selects two positions $li < ri$ and assigns values $xi$ and $yi$ to those positions, overwriting whatever is currently there.
codeforces competitive-programming Jul 1, 2026
Practice › Codeforces Solutions › The 2023 Guangdong Provincial Collegiate Programming Contest ›

CF 104369G - Swapping Operation

We are given an array of non-negative integers. For any split point $k$, we can divide the array into a prefix and a suffix. For that split, we compute the bitwise AND of the prefix and the bitwise AND of the suffix, then sum the two results.
codeforces competitive-programming Jul 1, 2026
Practice › Codeforces Solutions › The 2023 Guangdong Provincial Collegiate Programming Contest ›

CF 104369F - Traveling in Cells

We are given a line of cells, each cell having a fixed position, a color, and a value associated with a single removable ball. The structure changes over time because both colors and values of individual cells can be updated.
codeforces competitive-programming Jul 1, 2026
Practice › Codeforces Solutions › The 2023 Guangdong Provincial Collegiate Programming Contest ›

CF 104369E - New but Nostalgic Problem

We are given a collection of strings and we are allowed to pick exactly k of them. Once the subset is fixed, we look at every pair inside it and compute their longest common prefix. Among all these pairwise LCP values, we take the lexicographically largest one.
codeforces competitive-programming Jul 1, 2026
Practice › Codeforces Solutions › The 2023 Guangdong Provincial Collegiate Programming Contest ›

CF 104369D - New Houses

We are given a line of houses indexed from 1 to m, and we must place n people into distinct houses. Two people are considered neighbors only when they occupy adjacent house indices.
codeforces competitive-programming Jul 1, 2026
Practice › Codeforces Solutions › The 2023 Guangdong Provincial Collegiate Programming Contest ›

CF 104369C - Trading

We are given a street with several shops, each shop offering the same type of product at a fixed price. In each shop, the price is symmetric: if you buy or sell one unit there, the cost or revenue is exactly the same value.
codeforces competitive-programming Jul 1, 2026
Practice › Codeforces Solutions › The 2023 Guangdong Provincial Collegiate Programming Contest ›

CF 104369B - Base Station Construction

We are given a line of positions from 1 to n, where each position has a cost for building a base station. We are allowed to choose any subset of positions to build base stations, paying the sum of their costs.
codeforces competitive-programming Jul 1, 2026
Practice › Codeforces Solutions › The 2023 Guangdong Provincial Collegiate Programming Contest ›

CF 104369A - Programming Contest

We are looking at a yearly event that starts at some initial year y1. From that year onward, the contest is intended to happen once every year. However, there is a small list of exceptional years where the contest did not take place.
codeforces competitive-programming Jul 1, 2026