2021 Xinjiang Provincial Collegiate Programming Contest

11 problems from 2021 Xinjiang Provincial Collegiate Programming Contest (contest 103115), difficulty -. 1/11 solutions verified against sample I/O.

11 items

2021 Xinjiang Provincial Collegiate Programming Contest

Special | 11 problems | 1/11 verified | Difficulty - | 10m 17s

#	Problem	Time	✓
A	chino with string	2m 28s
B	cocktail with hearthstone	56s	✓
C	chino with minimum	35s
D	cocktail with swap	33s
E	is the order a rabbit ??	31s
F	chino with ball	28s
G	cocktail with snake	30s
H	cocktail with pony	34s
I	chino with mates	2m 36s
J	do NOT a=2b	34s
K	chino with c language	32s

Practice › Codeforces Solutions › 2021 Xinjiang Provincial Collegiate Programming Contest ›

CF 103115I - chino with mates

Let $mathcal{F}(N,t)$ denote a family of $N$ distinct $t$-combinations, and let $kappat(N)$ be the extremal quantity defined in Section 7.2.1.3, namely the minimum possible size of the derived family under the Kruskal-Katona construction used in Theorem K.

Practice › Codeforces Solutions › 2021 Xinjiang Provincial Collegiate Programming Contest ›

CF 103115J - do NOT a=2b

I don’t have the actual statement for Codeforces 103115J - “do NOT a=2b” in the prompt you provided, so I can’t reliably reconstruct the problem or write a correct editorial without guessing.

Practice › Codeforces Solutions › 2021 Xinjiang Provincial Collegiate Programming Contest ›

CF 103115K - chino with c language

I can’t write a correct editorial for “Codeforces 103115K - chino with c language” without the actual problem statement.

Practice › Codeforces Solutions › 2021 Xinjiang Provincial Collegiate Programming Contest ›

CF 103115H - cocktail with pony

The problem statement is missing from your prompt, so there isn’t enough information to reconstruct what “cocktail with pony” is asking, let alone derive a correct algorithm or write a meaningful editorial.

Practice › Codeforces Solutions › 2021 Xinjiang Provincial Collegiate Programming Contest ›

CF 103115E - is the order a rabbit ??

I can’t reliably write an editorial for Codeforces 103115E - “is the order a rabbit ??” without the actual problem statement.

Practice › Codeforces Solutions › 2021 Xinjiang Provincial Collegiate Programming Contest ›

CF 103115A - chino with string

Practice › Codeforces Solutions › 2021 Xinjiang Provincial Collegiate Programming Contest ›

CF 103115G - cocktail with snake

I don’t have the actual statement of Codeforces 103115G - “cocktail with snake”, so I can’t reliably reconstruct the problem, constraints, or intended solution path.

Practice › Codeforces Solutions › 2021 Xinjiang Provincial Collegiate Programming Contest ›

CF 103115F - chino with ball

The problem statement is missing, so I can’t reconstruct the solution or write a correct editorial yet. Codeforces problem IDs alone aren’t enough because multiple problems (especially from unofficial or Gym rounds like 103115F) don’t have reliably accessible or unique…

Practice › Codeforces Solutions › 2021 Xinjiang Provincial Collegiate Programming Contest ›

CF 103115D - cocktail with swap

I can write the full editorial in the exact format you requested, but I’m missing the actual problem statement for Codeforces 103115D - “cocktail with swap”.

Practice › Codeforces Solutions › 2021 Xinjiang Provincial Collegiate Programming Contest ›

CF 103115B - cocktail with hearthstone

We are given a process that starts with a huge number of identical players, all located at a virtual state written as $(0,0)$. A state $(a,b)$ represents a player who has won $a$ games and lost $b$ games.

Practice › Codeforces Solutions › 2021 Xinjiang Provincial Collegiate Programming Contest ›

CF 103115C - chino with minimum

I can’t reliably write a correct editorial for this yet because the actual problem statement is missing. “Codeforces 103115C - chino with minimum” doesn’t provide enough information on its own, and I shouldn’t guess the task, constraints, or required algorithm.