The 16th Heilongjiang Provincial Collegiate Programming Contest

12 problems from The 16th Heilongjiang Provincial Collegiate Programming Contest (contest 103107), difficulty -. 2/12 solutions verified against sample I/O.

12 items

The 16th Heilongjiang Provincial Collegiate Programming Contest

Special | 12 problems | 2/12 verified | Difficulty - | 12m 7s

#	Problem	Rating	Tags	Accepted	Time	✓
A	And RMQ				2m 38s
B	Bo Bing				36s
C	Cookie				1m	✓
D	Doin' Time				30s
E	Elastic Search				51s	✓
F	Function				29s
G	Go? No				30s
H	Hack DSU!				32s
I	ICU4C				27s
J	JOJO's Factory				36s
K	Keep Eating				1m 35s
L	Labi-Ribi				2m 23s

Practice › Codeforces Solutions › The 16th Heilongjiang Provincial Collegiate Programming Contest ›

CF 103107L - Labi-Ribi

Fix an integer $t ge 1$. Let $N ge 0$ be given. Define $kappat N$ in the discrete sense (as in earlier parts of Section 7.2.1.3) as the unique integer $m ge t-1$ such that $$binom{m}{t} le N < binom{m+1}{t},$$ and set $$kappat N = binom{m}{t-1}.

Practice › Codeforces Solutions › The 16th Heilongjiang Provincial Collegiate Programming Contest ›

CF 103107H - Hack DSU!

I can write the full editorial, but I’m missing the actual problem statement for Codeforces 103107H - Hack DSU!. Right now I don’t know: what operations DSU supports in this problem, what “hack” means in context, or what the input/output is supposed to represent.

Practice › Codeforces Solutions › The 16th Heilongjiang Provincial Collegiate Programming Contest ›

CF 103107K - Keep Eating

For real $x ge t-1$, define the generalized binomial coefficients $$binom{x}{t} = frac{x(x-1)cdots(x-t+1)}{t!}, qquad binom{x}{t-1} = frac{x(x-1)cdots(x-t+2)}{(t-1)!}.

Practice › Codeforces Solutions › The 16th Heilongjiang Provincial Collegiate Programming Contest ›

CF 103107J - JOJO's Factory

I’m missing the actual problem statement for Codeforces 103107J - JOJO’s Factory, so I can’t reconstruct the model, constraints, or intended solution safely without guessing.

Practice › Codeforces Solutions › The 16th Heilongjiang Provincial Collegiate Programming Contest ›

CF 103107A - And RMQ

For real $x ge t-1$, define the generalized binomial coefficients $$binom{x}{t} = frac{x(x-1)cdots(x-t+1)}{t!}, qquad binom{x}{t-1} = frac{x(x-1)cdots(x-t+2)}{(t-1)!}.

Practice › Codeforces Solutions › The 16th Heilongjiang Provincial Collegiate Programming Contest ›

CF 103107I - ICU4C

The problem statement for Codeforces 103107I - ICU4C is missing from your prompt, so there’s no way to correctly reconstruct the task or produce a valid editorial.

Practice › Codeforces Solutions › The 16th Heilongjiang Provincial Collegiate Programming Contest ›

CF 103107G - Go? No

I can’t write a correct editorial for this yet because the actual problem statement is missing. “Codeforces 103107G - Go?

Practice › Codeforces Solutions › The 16th Heilongjiang Provincial Collegiate Programming Contest ›

CF 103107E - Elastic Search

We are given a collection of strings, all composed of lowercase letters. The task is not about processing them independently, but about understanding how they relate through containment structure between strings.

Practice › Codeforces Solutions › The 16th Heilongjiang Provincial Collegiate Programming Contest ›

CF 103107F - Function

I can’t reliably write a correct editorial for this because the actual problem statement for Codeforces 103107F - Function is missing from your prompt.

Practice › Codeforces Solutions › The 16th Heilongjiang Provincial Collegiate Programming Contest ›

CF 103107D - Doin' Time

The problem statement for “Codeforces 103107D - Doin' Time” is not included in your message, so I can’t reliably derive the solution or write a correct editorial.

Practice › Codeforces Solutions › The 16th Heilongjiang Provincial Collegiate Programming Contest ›

CF 103107C - Cookie

We are given two simple polygons, each described by its vertices in counterclockwise order. You can think of them as two “broken cookie pieces” lying in the plane after a convex cookie has been shattered.

Practice › Codeforces Solutions › The 16th Heilongjiang Provincial Collegiate Programming Contest ›

CF 103107B - Bo Bing

I can’t write a correct editorial for “Codeforces 103107B - Bo Bing” yet because the actual problem statement is not available from the information you provided, and the title alone is not enough to reliably reconstruct the task.