你好，Codeforces!
We are excited to invite you to participate in Codeforces Round 1129 (Div. 2), which will be held on Oct/24/2026 14:05 (Moscow time). Note the unusual start time of the round.
You will be given 2 hours to solve 6 problems. One of the problems will be divided into 2 subtasks. At least one problem will be interactive so we recommend reading the guide to interactive problems if you have not encountered them before. All the problems were authored and prepared by Getaway_Car and me, _O_v_O_.
We'd like to express our sincere gratitude to:
- Um_nik for preliminary reviewing the round.
- satyam343 for perfectly coordinating the round.
- RockyYue, JDScript0117, AksLolCoding, lkrqwq, nifeshe, szh131421, harmis_yz, Proof_by_QED, employed, ZQZBD, wangzeyu2013, Eterminal, lrb828281, tkdqmx, RainRecall, esc_qwq, MornStar, Libingyue20111, Dim_Star, liang0504, samsoom, a_foolish_OIer for testing the round and giving helpful feedback.
- zhuchenyao, Danielcdo, __WBJ0429__, ztyroy who didn't test, for being willing to test the round.
- Alexdat2000 for translating this round to Russian.
- MikeMirzayanov and KAN for creating the amazing Codeforces and Polygon platforms.
- You for participating in the round.
Good Luck & Have Fun! We hope you enjoy this round!
UPD1: Scoring distribution:
