Dear Codeforces community,

We are excited to invite you to TLX Regular Open Contest #34 (based on BNPCHS 2023 Final Round)!

BNPCHS (Bina Nusantara Programming Contest for High School Students) is an annual competitive programming competition hosted by Binus University as part of BeeFest, a national-level competition for high school students. The problemset will be based on BNPCHS 2023 final round. The TROC will be happening alongside the onsite contest and is open for everyone to join!

Key details:

• Contest URL: TLX
• Time: 15th October 2023, 06:05 UTC (Note the unusual time of the round)
• Writers: Zanite, vioalbert, Owmicron, Twits, SunShine11, ArgoCahaya
• Duration: 120 minutes
• Problems: 8
• Scoring distribution: 100 — 200 — 250 — 400 — 550 — 600 — 700 — 800

Many thanks to:

• Pyqe and the rest of the TROC team for their help in coordinating the round.
• Zanite, vioalbert, Owmicron, Chrisedyong, Twits, SunShine11, siplusplus, and ArgoCahaya in preparing the problem components.
• jonathanirvings, malfple, rfpermen, trainerherp, steven.novaryo, joelgun14, KerakTelor, hocky, TypeYippie, kyonrevens, bonk, and takeonicky for testing the problemset and providing amazing feedback.
• fushar for the amazing TLX platform.

Please register to the contest and we hope you will enjoy TROC #34!

UPD: Added scoring distribution.

UPD2: Contest is over!

Congratulations to the top 5:

1. heno239

2. Morphymorphymorphy

3. hos.lyric

4. errorgorn

5. tute7627

Congratulations to our first solvers:

• A: wakaka

• B: Morphymorphymorphy

• C: errorgorn

• D: errorgorn

• E: Morphymorphymorphy

• F: hos.lyric

• G: hos.lyric

• H: hos.lyric

You can upsolve the problem here. Editorial is available in the upsolve link!

Thank you for participating and see you on the next contest!

We are excited to invite you to BNPCHS 2023 Elimination Round (Mirror, Unrated) on Saturday, September 23, 2023, 19:05 UTC+7.

The contest will be 3 hours long and will feature 6 problems. The contest difficulty will be similar to Codeforces Div. 3 Rounds. The order of the problems is different from the original BNPCHS contest.

The problems were written by Owmicron vioalbert siplusplus SunShine11.

Problem components were prepared by Owmicron vioalbert Chrisedyong Twits siplusplus SunShine11 ArgoCahaya.

We would also like to thank:

• fushar for their help in hosting the mirror contest;
• Zanite for supervising the Scientific Committee;
• rfpermen joelgun14 trainerherp KerakTelor TypeYippie bonk blankts jiayi_ko undev for testing the problemset and providing invaluable feedback; and
• Every BNPCHS committee member, administrator, and manager.

BNPCHS is an annual Competitive Programming competition for high school students held by Binus University. This contest is mirrored from the Elimination Round of BNPCHS 2023, and is open for everyone to join (not limited to high school students).

We have put great effort into preparing this contest, and we truly hope that you will enjoy it. See you in the contest!

UPD: contest is over!

Congratulations to our top 5:

1. Morphymorphymorphy
2. Wibo
3. Romy67
4. bryan.noel
5. Umis

The upsolving link will be up soon is available here. The editorial is available here.

Thank you for participating, see you next year!

Happy Valentine's Day, Codeforces community!

We are excited to invite you to TOKI Regular Open Contest (TROC) #19!

Key details:

• Contest link: TLX (combined division)
• Time: 14th February 2021, 13:05 UTC
• Writer: rama_pang steven.novaryo vioalbert yz_ Berted Pyqe
• Duration: 2 hours
• Problems: 7

We would like to thank:

• prabowo for the amazing coordination of the round.
• hocky for helping with problem preparation.
• AMnu, JvThunder, and Valee for testing the problems and giving invaluable feedback.
• fushar for the amazing TLX platform.

Please register to the contest, and we hope you will be reminded that you are still alone enjoy TROC #19!

P.S. we encourage you to read all problems! :)

UPD: Contest is over!

Congratulations to our top 5:

1. tourist
2. rfpermen
3. natsugiri
4. kotatsugame
5. Nyaan

All problems are first solved by tourist, except problem D which is first solved by kotatsugame. Congratulations to both of them!

You can upsolve the problems here.

Editorial is available in the upsolve link.

Thank you for participating and see you on the next contest!