The 19th Zhejiang Provincial Collegiate Programming Contest

13 problems from The 19th Zhejiang Provincial Collegiate Programming Contest (contest 103687), difficulty -. 13/13 solutions verified against sample I/O.

13 items

The 19th Zhejiang Provincial Collegiate Programming Contest

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

# Problem Rating Tags Accepted Time ✓
A JB Loves Math 1m 2s ✓
B JB Loves Comma 43s ✓
C JB Wants to Earn Big Money 47s ✓
D The Profiteer 1m 4s ✓
E Easy Jump 1m 8s ✓
F Easy Fix 1m 19s ✓
G Easy Glide 54s ✓
H A=B 49s ✓
I Barbecue 49s ✓
J Frog 48s ✓
K Dynamic Reachability 54s ✓
L Candy Machine 48s ✓
M BpbBppbpBB 48s ✓
Practice › Codeforces Solutions › The 19th Zhejiang Provincial Collegiate Programming Contest ›

CF 103687M - BpbBppbpBB

We are given a binary grid made of black and white cells. Black cells form a picture created by stamping several fixed shapes onto the grid. There are two possible stamp types.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › The 19th Zhejiang Provincial Collegiate Programming Contest ›

CF 103687L - Candy Machine

We are given a multiset of candy values. JB must choose any subset of these candies. After he chooses a subset, we compute the average value of that chosen subset, call it $X$.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › The 19th Zhejiang Provincial Collegiate Programming Contest ›

CF 103687K - Dynamic Reachability

We are given a directed graph where each edge is either active or inactive, and we are allowed to toggle edges between these two states over time. Initially, every edge is active.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › The 19th Zhejiang Provincial Collegiate Programming Contest ›

CF 103687J - Frog

We are given a frog that always lives on the unit circle centered at the origin. Its position is described by an angle in degrees, so a value ds corresponds to the point (cos(πds/180), sin(πds/180)).
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › The 19th Zhejiang Provincial Collegiate Programming Contest ›

CF 103687I - Barbecue

We are given a fixed string and many independent queries. Each query picks a substring, and two players then play a turn-based game on that substring.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › The 19th Zhejiang Provincial Collegiate Programming Contest ›

CF 103687H - A=B

We are not being asked to solve a standard substring or parsing task directly. Instead, we are given a very small rewriting language that behaves like a constrained string rewriting system, and our job is to output a program in that language which, when executed, decides…
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › The 19th Zhejiang Provincial Collegiate Programming Contest ›

CF 103687G - Easy Glide

We are trying to move a point from a start location $S$ to a target location $T$ on a 2D plane. Movement is continuous and unrestricted in direction. Under normal conditions, the character walks with constant speed $V1$.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › The 19th Zhejiang Provincial Collegiate Programming Contest ›

CF 103687F - Easy Fix

We are given a permutation of length $n$. For each position $i$, we look at how many smaller values appear to its left and how many smaller values appear to its right.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › The 19th Zhejiang Provincial Collegiate Programming Contest ›

CF 103687E - Easy Jump

We are simulating a progression through a linear sequence of stages, where each stage must be cleared before moving forward. At any stage, a single attempt can either succeed, letting us advance to the next stage, or fail, which keeps us at the same stage but reduces health.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › The 19th Zhejiang Provincial Collegiate Programming Contest ›

CF 103687D - The Profiteer

We are given a set of items, each item having a value and two possible prices. Normally every item i costs a fixed amount $ai$, but if we choose a segment $[l, r]$, then every item inside that segment becomes more expensive and costs $bi$ instead.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › The 19th Zhejiang Provincial Collegiate Programming Contest ›

CF 103687A - JB Loves Math

We are given two integers, a starting value and a target value. We are allowed to repeatedly apply one of two operations on the current value. The first operation adds a fixed positive odd number x, and the second operation subtracts a fixed positive even number y.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › The 19th Zhejiang Provincial Collegiate Programming Contest ›

CF 103687C - JB Wants to Earn Big Money

We are given two groups of participants in a stock market-like system. One group contains people who want to buy shares, and each of them specifies a maximum price they are willing to pay.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › The 19th Zhejiang Provincial Collegiate Programming Contest ›

CF 103687B - JB Loves Comma

We are given a single string composed only of lowercase English letters. The task is to scan this string from left to right and whenever the consecutive characters form the substring "cjb", we must insert a comma immediately after that occurrence.
codeforces competitive-programming Jul 2, 2026