The 15th Jilin Provincial Collegiate Programming Contest

13 problems from The 15th Jilin Provincial Collegiate Programming Contest (contest 103486), difficulty -. 13/13 solutions verified against sample I/O.

13 items

The 15th Jilin Provincial Collegiate Programming Contest

Special | 13 problems | 13/13 verified | Difficulty - | 10m 13s

# Problem Rating Tags Accepted Time ✓
A Random Number Checker 45s ✓
B Arithmetic Exercise 46s ✓
C Random Number Generator 51s ✓
D Rush Morning 1m 4s ✓
E Great Detective TJC 37s ✓
F Cooking 50s ✓
G Matrix Repair 31s ✓
H Visit the Park 48s ✓
I Nim Game 53s ✓
J Shuffle 45s ✓
K Bracket Sequence 42s ✓
L Suzuran Loves String 1m 1s ✓
M Sequence 40s ✓
Practice › Codeforces Solutions › The 15th Jilin Provincial Collegiate Programming Contest ›

CF 103486L - Suzuran Loves String

We are given a string $S$. From this string we consider all of its suffixes, meaning substrings that start at some position $i$ and run to the end. So suffix $si$ is $S[i dots n-1]$, and there are $n$ such suffixes.
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › The 15th Jilin Provincial Collegiate Programming Contest ›

CF 103486M - Sequence

We are given a sequence of integers and asked to compute a single derived value based on its spread. The “interesting value” is defined as the product of two quantities: the length of the sequence and the range of the sequence, where the range is the difference between the…
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › The 15th Jilin Provincial Collegiate Programming Contest ›

CF 103486K - Bracket Sequence

We are asked to count how many valid bracket structures of total length $2N$ exist when there are $K$ different kinds of brackets. Each kind behaves like a matched pair, for example type 1 could be “()”, type 2 could be “[]”, and so on.
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › The 15th Jilin Provincial Collegiate Programming Contest ›

CF 103486I - Nim Game

We are given an array of piles, where each position stores a number of stones. The system supports two operations over time. One operation increases all pile values in a given interval by some constant.
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › The 15th Jilin Provincial Collegiate Programming Contest ›

CF 103486J - Shuffle

We are given a deck containing $n cdot m$ distinct cards labeled from 1 to $nm$. Initially the cards are arranged in increasing order from bottom to top, so card 1 is at the bottom and card $nm$ is at the top. A shuffle operation is then repeatedly applied.
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › The 15th Jilin Provincial Collegiate Programming Contest ›

CF 103486H - Visit the Park

We are given an undirected graph where each edge carries a digit from 1 to 9. Alongside this graph, we are given a fixed walk described by a sequence of vertices $A1, A2, dots, AK$. The traveler starts at $A1$ and attempts to move step by step from $Ai$ to $A{i+1}$.
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › The 15th Jilin Provincial Collegiate Programming Contest ›

CF 103486G - Matrix Repair

We are given an $N times N$ binary matrix, except some entries are missing and written as $-1$. Every unknown entry must be replaced with either $0$ or $1$. Along with the matrix, we are given the XOR of each row and each column after reconstruction.
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › The 15th Jilin Provincial Collegiate Programming Contest ›

CF 103486D - Rush Morning

We are given a weighted tree with N markets connected by N − 1 roads. Each road has a cost, and Chiang’s daily routine is equivalent to choosing any simple path in this tree and summing the weights along that path.
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › The 15th Jilin Provincial Collegiate Programming Contest ›

CF 103486F - Cooking

We are given a collection of strings, each representing an ingredient name. For every ordered pair of ingredients $(i, j)$, we define a value that measures how well the end of the $i$-th string aligns with the beginning of the $j$-th string.
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › The 15th Jilin Provincial Collegiate Programming Contest ›

CF 103486E - Great Detective TJC

We are given several independent test cases. In each one, there is an array of positive integers, and the task is to determine whether we can pick two different positions such that the values at those positions differ by exactly one bit in binary, specifically their XOR equals 1.
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › The 15th Jilin Provincial Collegiate Programming Contest ›

CF 103486C - Random Number Generator

We are given a linear congruential generator that starts from an initial value and repeatedly applies an affine transformation modulo a prime number.
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › The 15th Jilin Provincial Collegiate Programming Contest ›

CF 103486B - Arithmetic Exercise

We are given three integers $A$, $B$, and $K$. The task is to compute the value of the fraction $A / B$ as a decimal number and output it with exactly $K$ digits after the decimal point.
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › The 15th Jilin Provincial Collegiate Programming Contest ›

CF 103486A - Random Number Checker

We are given a sequence of integers and need to judge whether it looks “balanced” in terms of parity. Each number is either odd or even, and we simply count how many fall into each category.
codeforces competitive-programming Jul 3, 2026