[Link to the mirror!](https://mirror.codeforces.com/gym/102503) (Please register at [the gym](https://mirror.codeforces.com/gyms))↵
↵
Hello Codeforces!↵
↵
I'd like to invite you to the [mirror](https://mirror.codeforces.com/gym/102503) of the 2020 eliminations round of the [National Olympiad in Informatics – Philippines](https://noi.ph/). The mirror will be held in the Codeforces gym. The NOI.PH is the Philippines' qualifier for the IOI.↵
↵
Contest format:↵
↵
- There are 17 problems over 9 days.↵
- The problems will have subtasks. The maximum score for each problem will be 100 points.↵
- The submission that achieves the maximum score is counted towards the final ranking.↵
- The problems range from easy to challenging. Everyone from the newbie to the grandmaster will find an interesting problem in the contest.↵
↵
Editorials will be released after the mirror contest ends.↵
↵
Acknowledgments: The problem setters were [user:kevinsogo,2020-01-30], [user:cjquines,2020-01-30], [user:Shisuko,2020-01-30], [user:andrewting,2020-01-30], [user:jabbawookiees,2020-01-30], [user:guissmo,2020-01-30], [user:verngutz,2020-01-30]. Thanks to [user:Benq,2020-01-30] and [user:ekzhang,2020-01-30] for additional help in testing. Lastly, thanks to [user:MikeMirzayanov,2020-01-30] for Codeforces, and Polygon, which was used to prepare the problems.↵
↵
**Edit:** Registration is now open! I've added the [mirror](https://mirror.codeforces.com/gym/102503) link. Please register at [the gym](https://mirror.codeforces.com/gyms).↵
↵
Have fun!↵
↵
**Edit:** Thanks for joining the mirror. Congratulations to [user:TLE,2020-02-10] for winning the mirror!↵
↵
Congratulations to the top five:↵
↵
- [user:TLE,2020-02-10]↵
- [user:briansu,2020-02-10]↵
- [user:baluteshih,2020-02-10]↵
- [user:yogahmad77,2020-02-10]↵
- [user:baIuteshih,2020-02-10]↵
↵
Please wait for a bit until we release the official editorials and solution analyses. Meanwhile, feel free to comment here about the problems.↵
↵
**Edit:** The editorials have been released. [Click here.](https://drive.google.com/open?id=1NYCsJ5HJCZ1xxO6uzUR4HRv43y2dLED-) Enjoy!↵
↵
We apologize for the delay. Anyway, once you see the document, I hope you'll understand that it took a long time to prepare given the amount of detail our editorialists usually aim for.
↵
Hello Codeforces!↵
↵
I'd like to invite you to the [mirror](https://mirror.codeforces.com/gym/102503) of the 2020 eliminations round of the [National Olympiad in Informatics – Philippines](https://noi.ph/). The mirror will be held in the Codeforces gym. The NOI.PH is the Philippines' qualifier for the IOI.↵
↵
Contest format:↵
↵
- There are 17 problems over 9 days.↵
- The problems will have subtasks. The maximum score for each problem will be 100 points.↵
- The submission that achieves the maximum score is counted towards the final ranking.↵
- The problems range from easy to challenging. Everyone from the newbie to the grandmaster will find an interesting problem in the contest.↵
↵
Editorials will be released after the mirror contest ends.↵
↵
Acknowledgments: The problem setters were [user:kevinsogo,2020-01-30], [user:cjquines,2020-01-30], [user:Shisuko,2020-01-30], [user:andrewting,2020-01-30], [user:jabbawookiees,2020-01-30], [user:guissmo,2020-01-30], [user:verngutz,2020-01-30]. Thanks to [user:Benq,2020-01-30] and [user:ekzhang,2020-01-30] for additional help in testing. Lastly, thanks to [user:MikeMirzayanov,2020-01-30] for Codeforces, and Polygon, which was used to prepare the problems.↵
↵
**Edit:** Registration is now open! I've added the [mirror](https://mirror.codeforces.com/gym/102503) link. Please register at [the gym](https://mirror.codeforces.com/gyms).↵
↵
Have fun!↵
↵
**Edit:** Thanks for joining the mirror. Congratulations to [user:TLE,2020-02-10] for winning the mirror!↵
↵
Congratulations to the top five:↵
↵
- [user:TLE,2020-02-10]↵
- [user:briansu,2020-02-10]↵
- [user:baluteshih,2020-02-10]↵
- [user:yogahmad77,2020-02-10]↵
- [user:baIuteshih,2020-02-10]↵
↵
Please wait for a bit until we release the official editorials and solution analyses. Meanwhile, feel free to comment here about the problems.↵
↵
**Edit:** The editorials have been released. [Click here.](https://drive.google.com/open?id=1NYCsJ5HJCZ1xxO6uzUR4HRv43y2dLED-) Enjoy!↵
↵
We apologize for the delay. Anyway, once you see the document, I hope you'll understand that it took a long time to prepare given the amount of detail our editorialists usually aim for.
