**Update 2019/06/12**: Me and [user:MikeMirzayanov,2019-06-11] managed to upload the Div.2 contest into Gym. Huge thanks him for the great system, and also a kind help!↵
↵
However, I decided to not just open it right now, but to give a training contest. The contest is scheduled in [June 14 Friday, 09:00 UTC.](https://www.timeanddate.com/worldclock/fixedtime.html?day=14&month=6&year=2019&hour=12&min=0&sec=0&p1=166) Even considering some obvious bias from the setter, I'm personally very proud of the Div.2 contest :D I hope you participate and share the same joy with us! (and of course, please don't cheat!)↵
↵
.↵
.↵
.↵
.↵
.↵
.↵
.↵
.↵
.↵
↵
↵
**Update 2019/06/05**: I managed to upload the Div.1 contest into Gym. Have fun! [https://mirror.codeforces.com/gym/102201](https://mirror.codeforces.com/gym/102201)↵
↵
↵
↵
Open Cup GP of Daejeon is scheduled at [2019/05/05 Sunday, 11:00 MSK](https://www.timeanddate.com/worldclock/fixedtime.html?msg=GP+of+Daejeon&iso=20190505T17&p1=3999&ah=5). Daejeon is a city where [KAIST](https://en.wikipedia.org/wiki/KAIST) is.↵
↵
Division 1 problem set is identical with MIPT PreFinals Camp 2019 Day 6. It was held on March 15. ↵
↵
Division 2 problem set is identical with KAIST RUN Spring Contest 2019. It was held on May 1 locally. Like last year, it was an IOI-style contest, but as we are doing in OpenCup, subtask will be disabled. Some problems between Div1 and Div2 are shared. ↵
↵
Problems were created by [user:ainta,2019-05-05], [user:InuyamaAoi,2019-05-05], [user:ko_osaga,2019-05-05], [user:kriii,2019-05-05], [user:kdh_9949,2019-05-05]. Some problems in Div1 were borrowed by [user:Diuven,2019-05-05], [user:imeimi,2019-05-05].↵
↵
Problems were tested by [user:arknave,2019-05-05], [user:dotorya,2019-05-05], [user:Namnamseo,2019-05-05], [user:tzuyu_chou,2019-05-05], [user:.o.,2019-05-05]. ↵
↵
List of relevant previous contests:↵
↵
* [XVIII Open Cup. GP of Korea](https://mirror.codeforces.com/blog/entry/57528)↵
* [KAIST RUN Spring Contest 2018](https://mirror.codeforces.com/blog/entry/59625)↵
* [XIX Open Cup. GP of Korea](https://mirror.codeforces.com/blog/entry/62435)↵
↵
Enjoy!↵
↵
However, I decided to not just open it right now, but to give a training contest. The contest is scheduled in [June 14 Friday, 09:00 UTC.](https://www.timeanddate.com/worldclock/fixedtime.html?day=14&month=6&year=2019&hour=12&min=0&sec=0&p1=166) Even considering some obvious bias from the setter, I'm personally very proud of the Div.2 contest :D I hope you participate and share the same joy with us! (and of course, please don't cheat!)↵
↵
.↵
.↵
.↵
.↵
.↵
.↵
.↵
.↵
.↵
↵
↵
**Update 2019/06/05**: I managed to upload the Div.1 contest into Gym. Have fun! [https://mirror.codeforces.com/gym/102201](https://mirror.codeforces.com/gym/102201)↵
↵
↵
↵
Open Cup GP of Daejeon is scheduled at [2019/05/05 Sunday, 11:00 MSK](https://www.timeanddate.com/worldclock/fixedtime.html?msg=GP+of+Daejeon&iso=20190505T17&p1=3999&ah=5). Daejeon is a city where [KAIST](https://en.wikipedia.org/wiki/KAIST) is.↵
↵
Division 1 problem set is identical with MIPT PreFinals Camp 2019 Day 6. It was held on March 15. ↵
↵
Division 2 problem set is identical with KAIST RUN Spring Contest 2019. It was held on May 1 locally. Like last year, it was an IOI-style contest, but as we are doing in OpenCup, subtask will be disabled. Some problems between Div1 and Div2 are shared. ↵
↵
Problems were created by [user:ainta,2019-05-05], [user:InuyamaAoi,2019-05-05], [user:ko_osaga,2019-05-05], [user:kriii,2019-05-05], [user:kdh_9949,2019-05-05]. Some problems in Div1 were borrowed by [user:Diuven,2019-05-05], [user:imeimi,2019-05-05].↵
↵
Problems were tested by [user:arknave,2019-05-05], [user:dotorya,2019-05-05], [user:Namnamseo,2019-05-05], [user:tzuyu_chou,2019-05-05], [user:.o.,2019-05-05]. ↵
↵
List of relevant previous contests:↵
↵
* [XVIII Open Cup. GP of Korea](https://mirror.codeforces.com/blog/entry/57528)↵
* [KAIST RUN Spring Contest 2018](https://mirror.codeforces.com/blog/entry/59625)↵
* [XIX Open Cup. GP of Korea](https://mirror.codeforces.com/blog/entry/62435)↵
↵
Enjoy!↵
