You are given a Codeforces account and $$$n = 6$$$ problems, authored and prepared by qwexd and jeroenodb.
In one operation, you may choose a problem $$$i$$$ ($$$1 \le i \le n$$$) and submit a program intended to solve it.
Your task is to maximize your score before the time limit expires.
The input consists of the problemset of Codeforces Round 1121 (Div. 2) . It will become available on Sep/13/2026 20:05 (Moscow time). **Note the unusual start time!** One of the problems is divided into two subtasks.
The round will be rated for participants with a rating below 2100. Participants with a rating of 2100 or higher are welcome to participate out of competition.
Score distribution: To be announced.
For each problem you choose to solve, submit a correct program. You may solve the problems in any order.
Printing YES is not sufficient.
We would like to thank:
- Proof_by_QED for coordinating the round;
- Um_nik for the preliminary review;
- Alexdat2000 for translating the statements to Russian;
- our testers: __baozii__, nifeshe, fuad720, cry, Noobish_Monk, TAhmed33, turska, temporary1, Rayo, shorya1835, Rvess, robert9524, flammifer, wakanda-forever, snowythecat, omsincoconut, EduardoBrito, Nyemot, osvarp, Argentum47, ismailfateen, SpyrosAliv, chromate00, Sacha, simplelife, nik_exists, samsoom, linearspace, Svivl, ALnQ417, Vespasian_1, and HobVIIb1 for testing the round and providing valuable feedback;
- our "testers who didn't test": sammyuri, _istil, AksLolCoding, BLOBVISGOD, Arpa, sorry12000, i-love-ayase-momo, Euclid73, naneosmic, and ArnedeB;
- KAN and MikeMirzayanov for Codeforces and Polygon;
- you, for participating in the round.
It can be shown that every problem has a solution. The proofs will be published after the contest.
Good luck and have fun!
