**TREMBLE BEFORE THE MIGHTY OMEGALULGRAPE**↵
↵
↵
↵
Hello Codeforces!↵
↵
We are honored to invite you to Codeforces Round #538 (Div. 2), which will take place at [contest_time:1114]. The round will be rated for all Division 2 participants **(with rating less than 2100)**. Still, we warmly welcome Division 1 participants to join us out of competition.↵
↵
You will be given **6** problems to solve in **2 hours.** The round's problems were initially prepared by Duy-Bach ~Akikaze,2019-02-05 Le, Xuan-Tung ~neko_nyaa,2019-02-05 Nguyen and Xuan-Quang ~xuanquang1999,2019-02-05 D. Nguyen.↵
↵
**There will be an interactive problem in this round.** Learn more about interactive problems [here](https://codeforces.net/blog/entry/45307).↵
↵
This is our first attempt in making a Codeforces round, so suggestions are much welcome to help us improve ourselves. ;)↵
↵
We also want to thanks many friends for making this round possible:↵
↵
- Dmitry ~_kun_,2019-02-05 Sayutin for coordinating the round, providing a neat idea on one problem and some Russian translations.↵
- Andrew ~GreenGrape,2019-02-05 Rayskiy for various suggestions on the problems, some other Russian translations, **and most importantly, peacefully submitted himself to be quarantined from pretests.** ;)↵
- Michal ~majk,2019-02-05 Svagerka for testing the round.↵
- And last but not least, Mike ~MikeMirzayanov,2019-02-05 Mirzayanov for the amazing Codeforces and Polygon platform, without which this round would never be possible :D↵
↵
P/s: I will be at the [Discord CP Community](https://codeforces.net/blog/entry/52778) to discuss the problems after the coding phase. However, please follow the rules and don't discuss the problems during the contest by any means.↵
↵
*Wish everyone good luck and high rating!*↵
↵
**UPD1:** Score distribution: 500-1250-1500-2000-2000-2750↵
↵
**UPD2:** [Editorial is published.](https://codeforces.net/blog/entry/65136)
↵
↵
↵
Hello Codeforces!↵
↵
We are honored to invite you to Codeforces Round #538 (Div. 2), which will take place at [contest_time:1114]. The round will be rated for all Division 2 participants **(with rating less than 2100)**. Still, we warmly welcome Division 1 participants to join us out of competition.↵
↵
You will be given **6** problems to solve in **2 hours.** The round's problems were initially prepared by Duy-Bach ~Akikaze,2019-02-05 Le, Xuan-Tung ~neko_nyaa,2019-02-05 Nguyen and Xuan-Quang ~xuanquang1999,2019-02-05 D. Nguyen.↵
↵
**There will be an interactive problem in this round.** Learn more about interactive problems [here](https://codeforces.net/blog/entry/45307).↵
↵
This is our first attempt in making a Codeforces round, so suggestions are much welcome to help us improve ourselves. ;)↵
↵
We also want to thanks many friends for making this round possible:↵
↵
- Dmitry ~_kun_,2019-02-05 Sayutin for coordinating the round, providing a neat idea on one problem and some Russian translations.↵
- Andrew ~GreenGrape,2019-02-05 Rayskiy for various suggestions on the problems, some other Russian translations, **and most importantly, peacefully submitted himself to be quarantined from pretests.** ;)↵
- Michal ~majk,2019-02-05 Svagerka for testing the round.↵
- And last but not least, Mike ~MikeMirzayanov,2019-02-05 Mirzayanov for the amazing Codeforces and Polygon platform, without which this round would never be possible :D↵
↵
P/s: I will be at the [Discord CP Community](https://codeforces.net/blog/entry/52778) to discuss the problems after the coding phase. However, please follow the rules and don't discuss the problems during the contest by any means.↵
↵
*Wish everyone good luck and high rating!*↵
↵
**UPD1:** Score distribution: 500-1250-1500-2000-2000-2750↵
↵
**UPD2:** [Editorial is published.](https://codeforces.net/blog/entry/65136)
