Hello, Codeforces!

We are excited to invite you to TLX Regular Open Contest #36!

Key details:

• Contest links: TLX
• Time: 27th July 2024, 14:05 UTC
• Writer: yz_
• Duration: 2 hours
• Problems: 7
• Scoring distribution: 100 — 200 — 350 — 400 — 450 — 550 — 700
• The theme of the contest is related to...

  

I would like to thank:

• Pyqe for coordinating the contest and preparing one of the problem's components.
• steven.novaryo and ArvinCiu for testing the problems and giving feedback.
• fushar for the TLX platform.

Please register for the contest and I encourage you to read all problems! Enjoy the contest, and I hope to see your 1010000 ABFB!

UPD: Contest is Over!

Congratulations to our top 5:

1. tourist
2. kotatsugame
3. maspy
4. hos.lyric
5. hitonanode

Congratulations to our first solvers:

• A: aufannn
• B: tourist
• C: tourist
• D: hitonanode
• E: hitonanode
• F: hos.lyric
• G: tourist

Also, congratulations to hitonanode as the first legend rating in TLX! 🎉 🎉 🎉

You can upsolve the problems here.

Editorial is available in the upsolve link.

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

Hello, Codeforces! Hope you are ready to do some laundry!

We are excited to invite you to TLX Regular Open Contest (TROC) #29!

Key details:

• Contest links: TLX
• Time: 5th December 2022, 13:05 UTC
• Writer: yz_
• Duration: 2 hours
• Problems: 8 buttons
• Scoring distribution: 100 — 200 — 300 — 450 — 500 — 550 — 650 — 700

I would like to thank:

• Pyqe and steven.novaryo for their help in coordinating the round and in preparing the problem components.
• Kinon, Drew_, and markus_geger for testing the problems and giving feedback.
• prabowo for playing with me.
• fushar for the TLX platform.

Please register for the contest and I encourage you to read all problems! Enjoy the contest, and I hope to see your 101.0000% AP+!

UPD: The round has been rescheduled to 5th December 2022, 13:05 UTC due to a clash with AtCoder Grand Contest

UPD: Contest is Over! Perfect Challenge Clear!

Congratulations to our top 5:

1. gyh20
2. maroonrk
3. hos.lyric
4. djq_fpc
5. i_love_varya

Congratulations to our first solvers:

• A: Wibo
• B: errorgorn
• C: InternetPerson10
• D: maroonrk
• E: gyh20
• F: googol_S0
• G: gyh20
• H: gyh20

You can upsolve the problems here.

Editorial is available in the upsolve link.

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

Happy (late) new year Codeforces! 🎉 🎉 🎉

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

Key details:

• Contest links: TLX
• Time: 9th January 2022, 13:05 UTC ⌚
• Writer: CyberSleeper 🎣 gansixeneh 🧐 ainunsy1 💫 joshjms ⚓ JvThunder 🥕 yz_ 🌸
• Duration: 2 hours
• Problems: 8

We would like to thank:

• prabowo 🤨 for being president the amazing coordination of the round. ☝
• steven.novaryo 🍂 for helping with problem preparation. 🖍
• MetalPower 🐻 and Zanite 👀 for testing the problems 📝 and giving invaluable feedback.
• fushar 👌 for the amazing TLX platform. 🔥

Please register for the contest, and we hope you will enjoy 💯 💯 TROC #25! 👍 👍 👍

P.S. We encourage you to read all problems! 😁 😁 😁 😁 😁

UPD: Contest is Over! 🎉 🎉 🎉

Congratulations to our top 5:

1. tute7627
2. hitonanode
3. SSRS_
4. awoo
5. Maksim1744

Congratulations to our first solvers:

• A: MahiruShiina
• B: Maksim1744
• C: Nyse
• D: hitonanode
• E: Maksim1744
• F: Yellowgood
• G: antontrygubO_o
• H: tute7627

You can upsolve the problems here.

Editorial is available in the upsolve link.

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

I am currently working on an interactive problem in Polygon. It works very fine in tests and invocations. However when I create a full package, it gives a comment PackageException: Failed on verification of the first test: Interactor 'interactor.cpp' returns verdict FAILED. What are the possible reasons for this?

Thank you.

Happy (late) new year Codeforces community!

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

Key details:

• Contest links: TLX (combined divisions)
• Time: 17th January 2021, 13:05 UTC
• Writer: steven.novaryo yz_
• Duration: 2 hours
• Problems: 7

We would like to thank:

• prabowo for admitting to be a masochist the amazing coordination of the round.
• hocky for showing his very long tongue helping with problem preparation.
• malfple and markus_geger for testing the problems and giving invaluable feedback.
• fushar for the amazing TLX platform.

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

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

UPD: Contest is Over!

Congratulations to our top 5:

1. uwi
2. neal
3. natsugiri
4. Pyqe
5. noimi

Congratulations to our first solvers:

• A: nandonathaniel
• B: Pa.Nic
• C: keymoon
• D: noimi
• E: saketh
• F: uwi
• G: neal

Editorial is available here (English version is available on page 8)

You can upsolve the problems here.

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

P.S.(2) Did you notice an easter egg in the problemset?

Dear Codeforces community,

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

Key details:

• Contest links: Div 1 (rating ≥ 2000) and Div 2 (rating < 2000 or unrated)
• Time: 1st November 2020, 14:05 UTC
• Writer: yz_
• Duration: 2 hours
• Problems: 6 for every division

• Div 2: 100 — 200 — 300 — 400 — 550 — 650
• Div 1: 100 — 200 — 350 — 400 — 500 — 600

I would like to thank prabowo as coordinator, hocky for helping with problem preparation, fushar for the TLX platform, and ayaze and steven.novaryo as testers.

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

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

UPD: Contest is Over!

Congratulations to our top 5:

Div 1:

1. Benq
2. neal
3. nuip
4. awoo
5. BohdanPastuschak

Div 2:

1. jschnei
2. saketh
3. riantkb
4. uwi
5. 300iq

Congratulations to our first solvers:

Div 1:

• A: antontrygubO_o
• B: antontrygubO_o
• C: neal
• D: Pa.Nic
• E: antontrygubO_o
• F: Benq

Div 2:

• A: 300iq
• B: 300iq
• C: 300iq
• D: uwi
• E: 300iq
• F: jschnei

Editorial is available here (English version is available on page 8)

You can upsolve the problems here.

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