![]() UPD: For video editorial of the problems, you can find it hereĪ: Sort the array of are some range-bitor of b, and for ranges with same right bound and same value of bitor, we only need to keep the smallest range. Lastly, me for gong to Yemen and doing Treelike problem setting and writing this Thunderous blog.Īlso, the editorial video for all the problems will be available on my channel right after the contest endsĪll the best everyone!! Eager to see you going All Around The World and being Unstoppable in climbing the ranklist.MikeMirzayanov for the great codeforces and polygon platform.Yuu, kshitij_sodani, Kuroni, thenymphsofdelphi for red testing.maomao90, vinfat, Mike4235, Dominater069, aryan12, 74TrAkToR, satyam343, AquaMoon for yellow testing.anusha777, ak2006, ghosty, Trumling, Qualified for cyan testing.astoria for giving problem idea of one of the problem and helping with the initial stages of the round.socho for helping with the initial stages of the round.Alexdat2000 for translating problem statements.darkkcyan for going to Lebanon and doing Quality coordination.Read problem statements to know which anime :)Īll the problems are prepared by me and StArChAn.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |