Hi Codeforces!↵
↵
I'm glad to introduce you to [contest:1163], which will take place on [contest_time:1163].↵
↵
You will have **6 problems** and **2 hours** to solve them. **Two problems will have subtasks**. Round will be rated for everyone with rating below **2100**. Participants from the first division can also participate out of competition as usual.↵
↵
The problems were prepared by me, [user:_iloveNQ_,2019-05-08], [user:_Shirone_,2019-05-08], and [user:LunarStellarshot,2019-05-08]. I would like to thank [user:_kun_,2019-05-08] for his immense help during the round preparation, [user:300iq,2019-05-08], [user:mohammedehab2002,2019-05-08], and [user:Um_nik,2019-05-08] for testing them, and of course [user:MikeMirzayanov,2019-05-08] for the Codeforces and Polygon platforms.↵
↵
In the contest, you will meet _Kuro_, _Shiro_, _Katie_, and _Selena_, the four naughty but smart cats who love playing and asking questions. I hope you will find our problems interesting.↵
↵
I will be in the community Discord server after the contest to discuss the problems with you. You can find the server [here](https://discord.gg/auC58F)!↵
↵
Good luck!↵
↵
**UPD1**: Problem B and C will have 2 subtasks. The scoring distribution will be **500 — (750 + 500) — (1000 + 750) — 2250 — 2750 — 3250**.↵
↵
**UPD2**: The contest will be delayed by 15 minutes due to technical reasons. Sorry for the inconvenience :(↵
↵
**UPD3**: Final standings!↵
↵
Div. 1:↵
1. [user:ainta,2019-05-09] (the only contestant to finish all problems!)↵
2. [user:dreamoon_love_AA,2019-05-09]↵
3. [user:hank55663,2019-05-09]↵
4. [user:tfg,2019-05-09]↵
5. [user:pmnox,2019-05-09]↵
↵
Div. 2:↵
1. [user:xht37,2019-05-09]↵
2. [user:Ekoos,2019-05-09]↵
3. [user:beka_asd,2019-05-09]↵
4. [user:bbao69,2019-05-09]↵
5. [user:OIerDb,2019-05-09]↵
↵
The editorial is available [here](https://codeforces.net/blog/entry/66943). Thank you for participating!
↵
I'm glad to introduce you to [contest:1163], which will take place on [contest_time:1163].↵
↵
You will have **6 problems** and **2 hours** to solve them. **Two problems will have subtasks**. Round will be rated for everyone with rating below **2100**. Participants from the first division can also participate out of competition as usual.↵
↵
The problems were prepared by me, [user:_iloveNQ_,2019-05-08], [user:_Shirone_,2019-05-08], and [user:LunarStellarshot,2019-05-08]. I would like to thank [user:_kun_,2019-05-08] for his immense help during the round preparation, [user:300iq,2019-05-08], [user:mohammedehab2002,2019-05-08], and [user:Um_nik,2019-05-08] for testing them, and of course [user:MikeMirzayanov,2019-05-08] for the Codeforces and Polygon platforms.↵
↵
In the contest, you will meet _Kuro_, _Shiro_, _Katie_, and _Selena_, the four naughty but smart cats who love playing and asking questions. I hope you will find our problems interesting.↵
↵
I will be in the community Discord server after the contest to discuss the problems with you. You can find the server [here](https://discord.gg/auC58F)!↵
↵
Good luck!↵
↵
**UPD1**: Problem B and C will have 2 subtasks. The scoring distribution will be **500 — (750 + 500) — (1000 + 750) — 2250 — 2750 — 3250**.↵
↵
**UPD2**: The contest will be delayed by 15 minutes due to technical reasons. Sorry for the inconvenience :(↵
↵
**UPD3**: Final standings!↵
↵
Div. 1:↵
1. [user:ainta,2019-05-09] (the only contestant to finish all problems!)↵
2. [user:dreamoon_love_AA,2019-05-09]↵
3. [user:hank55663,2019-05-09]↵
4. [user:tfg,2019-05-09]↵
5. [user:pmnox,2019-05-09]↵
↵
Div. 2:↵
1. [user:xht37,2019-05-09]↵
2. [user:Ekoos,2019-05-09]↵
3. [user:beka_asd,2019-05-09]↵
4. [user:bbao69,2019-05-09]↵
5. [user:OIerDb,2019-05-09]↵
↵
The editorial is available [here](https://codeforces.net/blog/entry/66943). Thank you for participating!
