The 10-th BIT Campus Programming Contest for Junior Grade Group

12 problems from The 10-th BIT Campus Programming Contest for Junior Grade Group (contest 104027), difficulty -. 8/12 solutions verified against sample I/O.

12 items

The 10-th BIT Campus Programming Contest for Junior Grade Group

Special | 12 problems | 8/12 verified | Difficulty - | 9m 25s

# Problem Rating Tags Accepted Time ✓
A lzd\u7684\u4eba\u751f\u7ecf\u9a8c 45s ✓
B Candies 30s
C \u5f02\u6216 2m 3s
D \u9971\u4e86\u6ca1\u7ea2\u5305 39s ✓
E \u6280\u80fd\u52a0\u70b9 49s ✓
F \u843d\u77f3 47s ✓
G \u4e09\u89d2\u529b\u91cf 50s ✓
H \u8fd8\u662f\u5206\u7cd6\u679c 44s ✓
I jump 25s
J runaway problem 35s
K \u96f6\u65f6\u56f0\u5883 II 40s ✓
L \u6838\u9178\u6392\u961f 38s ✓
Practice › Codeforces Solutions › The 10-th BIT Campus Programming Contest for Junior Grade Group ›

CF 104027L - 核酸排队

We are modeling a queue of samples where each group contributes some number of collected items, and there is a periodic maintenance penalty applied after processing every fixed batch of people.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › The 10-th BIT Campus Programming Contest for Junior Grade Group ›

CF 104027K - 零时困境 II

We are given a setup involving a matrix expression of the form $A^T times A$, where $A$ is some matrix and $A^T$ is its transpose. The key operation described in the problem is swapping rows of $A$, and we are told that this operation does not change the value of $A^T times A$.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › The 10-th BIT Campus Programming Contest for Junior Grade Group ›

CF 104027J - runaway problem

I can’t write a correct editorial from that input because the actual problem content is missing. Right now I only see: There is no statement, no description of what “runaway” refers to, and no constraints.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › The 10-th BIT Campus Programming Contest for Junior Grade Group ›

CF 104027H - 还是分糖果

We are given two sequences, call them A and B. Each query gives us two prefixes: A[1..x] and B[1..y]. The task is to decide whether these two prefixes “match in terms of distinct elements” in a symmetric way: every value that appears in the prefix of A must already appear in…
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › The 10-th BIT Campus Programming Contest for Junior Grade Group ›

CF 104027I - jump

I can’t write a correct editorial for “Codeforces 104027I - jump” without the actual problem statement. That code alone isn’t enough to reliably reconstruct the task, and guessing would risk producing a completely wrong solution and explanation.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › The 10-th BIT Campus Programming Contest for Junior Grade Group ›

CF 104027G - 三角力量

We are given an undirected graph, but unlike the standard simple version, between any two vertices there may be multiple edges. Each pair of vertices can be connected by several parallel edges, and those parallel edges all count as distinct choices when forming structures.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › The 10-th BIT Campus Programming Contest for Junior Grade Group ›

CF 104027C - 异或

Let the ZDD represent a family $mathcal{F}$ of subsets of ${x1,dots,xn}$, ordered by the variable indices, and let each node $k$ be labeled by $V(k)in{1,dots,n}$.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › The 10-th BIT Campus Programming Contest for Junior Grade Group ›

CF 104027F - 落石

The problem models a collection of stone blocks falling vertically onto a one dimensional ground made of columns. Each column starts empty at height zero, and as stones are dropped, they stack upward depending on where they land.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › The 10-th BIT Campus Programming Contest for Junior Grade Group ›

CF 104027E - 技能加点

The problem describes a character-building style optimization where you distribute a limited number of skill points between two attributes, denoted as E and R.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › The 10-th BIT Campus Programming Contest for Junior Grade Group ›

CF 104027D - 饱了没红包

We are given a sequence of orders, each with a price, and a collection of discount coupons. Each coupon has a threshold value and a discount value. A coupon can only be applied to an order if the order price is at least as large as the coupon’s threshold.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › The 10-th BIT Campus Programming Contest for Junior Grade Group ›

CF 104027A - lzd的人生经验

The task is essentially a reading-comprehension style simulation compressed into arithmetic. We are given a description of some process that consumes time, along with a limit in seconds, denoted by $m$.
codeforces competitive-programming Jul 2, 2026
Practice › Codeforces Solutions › The 10-th BIT Campus Programming Contest for Junior Grade Group ›

CF 104027B - Candies

We are given a collection of candy packs. Each pack contains either 2 candies or 3 candies. The task is to determine whether it is possible to distribute all candies among three people so that each person receives exactly the same total number of candies.
codeforces competitive-programming Jul 2, 2026