La Salle-Pui Ching Programming Challenge 2019

12 problems from La Salle-Pui Ching Programming Challenge 2019 (contest 103176), difficulty -. 0/12 solutions verified against sample I/O.

12 items

La Salle-Pui Ching Programming Challenge 2019

Special | 12 problems | 0/12 verified | Difficulty - | 11m 10s

# Problem Rating Tags Accepted Time ✓
A A Billionaire 35s
B Blokus Duo 36s
C camelCaseCounting 2m 14s
D Drawing Circles 31s
E Eat More 32s
F Find the Base 31s
G Guessing Game 31s
H Hacking 35s
I Ice-cream Sampler 26s
J Just A \$10 Note 2m 11s
K Kth number in Byteland 31s
L LRTB and TBRL 1m 57s
Practice › Codeforces Solutions › La Salle-Pui Ching Programming Challenge 2019 ›

CF 103176L - LRTB and TBRL

Let $S(n,t,r)$ denote the set of Ising configurations from Exercise 13, restricted to those binary strings $a{n-1}dots a1a0$ with $a0=0$ and with the fixed parameters $t$ and $r$ as in the exercise.
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › La Salle-Pui Ching Programming Challenge 2019 ›

CF 103176I - Ice-cream Sampler

I can write the full editorial in exactly that format, but I’m missing the actual problem statement for Codeforces 103176I - Ice-cream Sampler. Right now the prompt includes no description of: - what the sampler does, - what the input represents, - what needs to be computed.
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › La Salle-Pui Ching Programming Challenge 2019 ›

CF 103176J - Just A \$10 Note

Let $[n]={1,2,dots,n}$ and let $mathcal{A}$ be a family of $r$-subsets of $[n]$ such that for all $alpha,betainmathcal{A}$ one has $alphacapbetaneqvarnothing$. Assume $rle n/2$. The goal is to prove $$ Let $mathcal{B}={[n]setminus alpha : alphainmathcal{A}}$.
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › La Salle-Pui Ching Programming Challenge 2019 ›

CF 103176K - Kth number in Byteland

I don’t have the actual statement for Codeforces 103176K - Kth number in Byteland from what you provided, so I can’t reliably reconstruct the problem or derive a correct solution without guessing.
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › La Salle-Pui Ching Programming Challenge 2019 ›

CF 103176C - camelCaseCounting

Fix $n,t,r$. We consider binary strings $a{n-1}cdots a1a0$ with $a0=0$, containing exactly $t$ ones and decomposable into exactly $r$ maximal alternating runs of $0$’s and $1$’s as in the Ising configurations of Exercise 13.
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › La Salle-Pui Ching Programming Challenge 2019 ›

CF 103176H - Hacking

I can’t responsibly write a correct editorial yet because the actual problem statement for Codeforces 103176H - “Hacking” is not present in your prompt, and it is not recoverable from the standard Codeforces archive data I can access here.
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › La Salle-Pui Ching Programming Challenge 2019 ›

CF 103176G - Guessing Game

The problem statement for Codeforces 103176G - Guessing Game is missing from your prompt, so I don’t have the actual rules of the game, input format, or what needs to be computed.
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › La Salle-Pui Ching Programming Challenge 2019 ›

CF 103176F - Find the Base

I can’t reliably write a correct editorial for Codeforces 103176F - Find the Base without the actual problem statement.
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › La Salle-Pui Ching Programming Challenge 2019 ›

CF 103176E - Eat More

I’m missing the actual statement of Codeforces 103176E “Eat More”, so I can’t safely reconstruct the solution or write a correct editorial without guessing the problem. Please paste the full problem statement (or even a screenshot / text dump).
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › La Salle-Pui Ching Programming Challenge 2019 ›

CF 103176D - Drawing Circles

I can’t reliably write a correct editorial for “Codeforces 103176D - Drawing Circles” without the actual problem statement (or at least the input/output description and constraints).
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › La Salle-Pui Ching Programming Challenge 2019 ›

CF 103176B - Blokus Duo

I can’t write a correct Codeforces editorial for this yet because the actual problem statement for 103176B - Blokus Duo is missing from your prompt. Right now I don’t know: - what the input represents (grid, pieces, moves, graph, etc.
codeforces competitive-programming Jul 3, 2026
Practice › Codeforces Solutions › La Salle-Pui Ching Programming Challenge 2019 ›

CF 103176A - A Billionaire

I can’t reliably reconstruct Codeforces 103176A (“A Billionaire”) from the title alone, and I don’t have the problem statement in the prompt.
codeforces competitive-programming Jul 3, 2026